Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …0110001111001111110000 |
3 | 1022102221120211001002122000 |
4 | 2101222203012033033300 |
5 | 2303001000042334300 |
6 | 33142311332414000 |
7 | 2052125245102155 |
oct | 221524306171760 |
9 | 38387524032560 |
10 | 10010010121200 |
11 | 320a248831261 |
12 | 1158010177300 |
13 | 577c2ac7a76b |
14 | 2686b676822c |
15 | 1255b3b4ec00 |
hex | 91aa318f3f0 |
10010010121200 has 240 divisors, whose sum is σ = 36856781714400. Its totient is φ = 2577289881600.
The previous prime is 10010010121159. The next prime is 10010010121213. The reversal of 10010010121200 is 212101001001.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
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, 15667021 + ... + 16293420.
It is an arithmetic number, because the mean of its divisors is an integer number (153569923810).
Almost surely, 210010010121200 is an apocalyptic number.
10010010121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10010010121200 is an abundant number, since it is smaller than the sum of its proper divisors (26846771593200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010010121200 is a wasteful number, since it uses less digits than its factorization.
10010010121200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31960497 (or 31960480 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10010010121200 its reverse (212101001001), we get a palindrome (10222111122201).
The spelling of 10010010121200 in words is "ten trillion, ten billion, ten million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •