Base | Representation |
---|---|
bin | 111010100001100110… |
… | …1101111101000010100 |
3 | 110000101222100022002120 |
4 | 1311003031233220110 |
5 | 4024344010244040 |
6 | 133423135335540 |
7 | 12036340030062 |
oct | 1650315575024 |
9 | 400358308076 |
10 | 125681728020 |
11 | 49335071512 |
12 | 204366815b0 |
13 | bb0c358604 |
14 | 6123b87032 |
15 | 3408bc07d0 |
hex | 1d4336fa14 |
125681728020 has 192 divisors, whose sum is σ = 368623906560. Its totient is φ = 31962636288.
The previous prime is 125681728019. The next prime is 125681728031. The reversal of 125681728020 is 20827186521.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 51997852 + ... + 52000268.
It is an arithmetic number, because the mean of its divisors is an integer number (1919916180).
Almost surely, 2125681728020 is an apocalyptic number.
125681728020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 125681728020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184311953280).
125681728020 is an abundant number, since it is smaller than the sum of its proper divisors (242942178540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125681728020 is a wasteful number, since it uses less digits than its factorization.
125681728020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2922 (or 2920 counting only the distinct ones).
The product of its (nonzero) digits is 107520, while the sum is 42.
The spelling of 125681728020 in words is "one hundred twenty-five billion, six hundred eighty-one million, seven hundred twenty-eight thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •