Base | Representation |
---|---|
bin | 1001001101001000000100… |
… | …1110011111111110000000 |
3 | 1022211120100121222002011210 |
4 | 2103102001032133332000 |
5 | 2311311013404324300 |
6 | 33305324010210120 |
7 | 2063140365063360 |
oct | 223220116377600 |
9 | 38746317862153 |
10 | 10121111011200 |
11 | 3252380344312 |
12 | 1175657723940 |
13 | 58555557a467 |
14 | 26dc15c3c9a0 |
15 | 128417707050 |
hex | 9348139ff80 |
10121111011200 has 192 divisors, whose sum is σ = 38098753845120. Its totient is φ = 2313396787200.
The previous prime is 10121111011183. The next prime is 10121111011229. The reversal of 10121111011200 is 211011112101.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 75238686 + ... + 75373085.
It is an arithmetic number, because the mean of its divisors is an integer number (198431009610).
Almost surely, 210121111011200 is an apocalyptic number.
10121111011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10121111011200 is an abundant number, since it is smaller than the sum of its proper divisors (27977642833920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10121111011200 is a wasteful number, since it uses less digits than its factorization.
10121111011200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150611805 (or 150611788 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10121111011200 its reverse (211011112101), we get a palindrome (10332122123301).
The spelling of 10121111011200 in words is "ten trillion, one hundred twenty-one billion, one hundred eleven million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •