Base | Representation |
---|---|
bin | 110111111011000100… |
… | …0000100100010100000 |
3 | 102110222111222020110000 |
4 | 1233312020010202200 |
5 | 3431422404142442 |
6 | 131100430540000 |
7 | 11451012202605 |
oct | 1576610044240 |
9 | 373874866400 |
10 | 120093427872 |
11 | 46a27677940 |
12 | 1b337067600 |
13 | b42b669632 |
14 | 5b539066ac |
15 | 31cd2acd4c |
hex | 1bf62048a0 |
120093427872 has 480 divisors, whose sum is σ = 393081885504. Its totient is φ = 35665920000.
The previous prime is 120093427871. The next prime is 120093427943. The reversal of 120093427872 is 278724390021.
120093427872 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (120093427871) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 478459747 + ... + 478459997.
Almost surely, 2120093427872 is an apocalyptic number.
120093427872 is a gapful number since it is divisible by the number (12) 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 120093427872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196540942752).
120093427872 is an abundant number, since it is smaller than the sum of its proper divisors (272988457632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120093427872 is a wasteful number, since it uses less digits than its factorization.
120093427872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 554 (or 537 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 45.
The spelling of 120093427872 in words is "one hundred twenty billion, ninety-three million, four hundred twenty-seven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •