Base | Representation |
---|---|
bin | 111010100001111101… |
… | …1110111110011100100 |
3 | 110000102211002122100120 |
4 | 1311003323313303210 |
5 | 4024410104221012 |
6 | 133424250441540 |
7 | 12036544562046 |
oct | 1650373676344 |
9 | 400384078316 |
10 | 125693820132 |
11 | 493409804a1 |
12 | 2043a7332b0 |
13 | bb11a004ca |
14 | 6125613a96 |
15 | 3409cad58c |
hex | 1d43ef7ce4 |
125693820132 has 12 divisors (see below), whose sum is σ = 293285580336. Its totient is φ = 41897940040.
The previous prime is 125693820127. The next prime is 125693820143. The reversal of 125693820132 is 231028396521.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5237242494 + ... + 5237242517.
It is an arithmetic number, because the mean of its divisors is an integer number (24440465028).
Almost surely, 2125693820132 is an apocalyptic number.
125693820132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
125693820132 is an abundant number, since it is smaller than the sum of its proper divisors (167591760204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125693820132 is a wasteful number, since it uses less digits than its factorization.
125693820132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10474485018 (or 10474485016 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 42.
The spelling of 125693820132 in words is "one hundred twenty-five billion, six hundred ninety-three million, eight hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •