Base | Representation |
---|---|
bin | 101111001000111100… |
… | …1111001000011000000 |
3 | 100200022001002112010210 |
4 | 1132101321321003000 |
5 | 3124310410320000 |
6 | 114301055354120 |
7 | 10212424552044 |
oct | 1362171710300 |
9 | 320261075123 |
10 | 101232120000 |
11 | 39a289900a0 |
12 | 17752522940 |
13 | 9713b6bb2b |
14 | 4c84952024 |
15 | 29774bc350 |
hex | 1791e790c0 |
101232120000 has 560 divisors, whose sum is σ = 372270235392. Its totient is φ = 24061440000.
The previous prime is 101232119951. The next prime is 101232120019. The reversal of 101232120000 is 21232101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 69959277 + ... + 69960723.
Almost surely, 2101232120000 is an apocalyptic number.
101232120000 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 101232120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (186135117696).
101232120000 is an abundant number, since it is smaller than the sum of its proper divisors (271038115392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101232120000 is a wasteful number, since it uses less digits than its factorization.
101232120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1546 (or 1521 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 101232120000 its reverse (21232101), we get a palindrome (101253352101).
The spelling of 101232120000 in words is "one hundred one billion, two hundred thirty-two million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •