Base | Representation |
---|---|
bin | 11101101101110001111… |
… | …00100001000111110000 |
3 | 10121121101221200011112002 |
4 | 32312320330201013300 |
5 | 113212012042334300 |
6 | 2101013502153132 |
7 | 133523403556466 |
oct | 16667074410760 |
9 | 3547357604462 |
10 | 1021010121200 |
11 | 36400a660a23 |
12 | 145a662827a8 |
13 | 75386015414 |
14 | 375ba952836 |
15 | 1b85b0125d5 |
hex | edb8f211f0 |
1021010121200 has 240 divisors, whose sum is σ = 2751693880320. Its totient is φ = 362209858560.
The previous prime is 1021010121193. The next prime is 1021010121259. The reversal of 1021010121200 is 21210101201.
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, 8153462 + ... + 8277738.
It is an arithmetic number, because the mean of its divisors is an integer number (11465391168).
Almost surely, 21021010121200 is an apocalyptic number.
1021010121200 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 1021010121200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1375846940160).
1021010121200 is an abundant number, since it is smaller than the sum of its proper divisors (1730683759120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021010121200 is a wasteful number, since it uses less digits than its factorization.
1021010121200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124384 (or 124373 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1021010121200 its reverse (21210101201), we get a palindrome (1042220222401).
The spelling of 1021010121200 in words is "one trillion, twenty-one billion, ten million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •