Base | Representation |
---|---|
bin | 10111000000110100010010… |
… | …010110000111111111000000 |
3 | 111021100200211101121100102212 |
4 | 113000310102112013333000 |
5 | 101231221030300320000 |
6 | 555131442230001252 |
7 | 30214161121244633 |
oct | 2700642226077700 |
9 | 437320741540385 |
10 | 101211212120000 |
11 | 2a281485741a44 |
12 | b4274b21a6228 |
13 | 446223a597088 |
14 | 1adc912465c1a |
15 | ba7b08999c35 |
hex | 5c0d12587fc0 |
101211212120000 has 280 divisors, whose sum is σ = 252821751454800. Its totient is φ = 40186286080000.
The previous prime is 101211212119961. The next prime is 101211212120021. The reversal of 101211212120000 is 21212112101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 10793555312 + ... + 10793564688.
Almost surely, 2101211212120000 is an apocalyptic number.
101211212120000 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 101211212120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126410875727400).
101211212120000 is an abundant number, since it is smaller than the sum of its proper divisors (151610539334800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101211212120000 is an equidigital number, since it uses as much as digits as its factorization.
101211212120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11369 (or 11344 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101211212120000 its reverse (21212112101), we get a palindrome (101232424232101).
The spelling of 101211212120000 in words is "one hundred one trillion, two hundred eleven billion, two hundred twelve million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •