Base | Representation |
---|---|
bin | 1001001101001000000100… |
… | …1110111010100010000000 |
3 | 1022211120100122011121102102 |
4 | 2103102001032322202000 |
5 | 2311311013421320000 |
6 | 33305324012405532 |
7 | 2063140366025516 |
oct | 223220116724200 |
9 | 38746318147372 |
10 | 10121111120000 |
11 | 3252380409031 |
12 | 11756577768a8 |
13 | 5855555b7b3a |
14 | 26dc15c6a4b6 |
15 | 1284177293d5 |
hex | 934813ba880 |
10121111120000 has 160 divisors (see below), whose sum is σ = 25571944920720. Its totient is φ = 3988017792000.
The previous prime is 10121111119963. The next prime is 10121111120017. The reversal of 10121111120000 is 2111112101.
It is a tau number, because it is divible by the number of its divisors (160).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4415867 + ... + 6304133.
Almost surely, 210121111120000 is an apocalyptic number.
10121111120000 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 10121111120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12785972460360).
10121111120000 is an abundant number, since it is smaller than the sum of its proper divisors (15450833800720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10121111120000 is an frugal number, since it uses more digits than its factorization.
10121111120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1888368 (or 1888341 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10121111120000 its reverse (2111112101), we get a palindrome (10123222232101).
The spelling of 10121111120000 in words is "ten trillion, one hundred twenty-one billion, one hundred eleven million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •