Base | Representation |
---|---|
bin | 1001001101000111101101… |
… | …0001000010001001101000 |
3 | 1022211120002122210121100010 |
4 | 2103101323101002021220 |
5 | 2311310312304342300 |
6 | 33305310035011520 |
7 | 2063135042104164 |
oct | 223217321021150 |
9 | 38746078717303 |
10 | 10121011012200 |
11 | 3252329953610 |
12 | 117562a139ba0 |
13 | 58553a93725a |
14 | 26dc0684bca4 |
15 | 12840da52a50 |
hex | 9347b442268 |
10121011012200 has 192 divisors, whose sum is σ = 35331530065920. Its totient is φ = 2374430688000.
The previous prime is 10121011012187. The next prime is 10121011012271. The reversal of 10121011012200 is 221011012101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24529054 + ... + 24938253.
It is an arithmetic number, because the mean of its divisors is an integer number (184018385760).
Almost surely, 210121011012200 is an apocalyptic number.
10121011012200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10121011012200 is an abundant number, since it is smaller than the sum of its proper divisors (25210519053720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10121011012200 is a wasteful number, since it uses less digits than its factorization.
10121011012200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49467368 (or 49467359 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10121011012200 its reverse (221011012101), we get a palindrome (10342022024301).
Subtracting from 10121011012200 its reverse (221011012101), we obtain a palindrome (9900000000099).
The spelling of 10121011012200 in words is "ten trillion, one hundred twenty-one billion, eleven million, twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •