Base | Representation |
---|---|
bin | 11101001000101111000… |
… | …01110001101100000010 |
3 | 10112201001220212112022110 |
4 | 32210113201301230002 |
5 | 112400244230011320 |
6 | 2043524213120150 |
7 | 132220511350245 |
oct | 16442741615402 |
9 | 3481056775273 |
10 | 1001122110210 |
11 | 356634371a02 |
12 | 142035929056 |
13 | 735368bb291 |
14 | 3665149d25c |
15 | 1b0950185e0 |
hex | e917871b02 |
1001122110210 has 256 divisors, whose sum is σ = 2635595366400. Its totient is φ = 242626627584.
The previous prime is 1001122110199. The next prime is 1001122110217. The reversal of 1001122110210 is 120112211001.
It is not an unprimeable number, because it can be changed into a prime (1001122110217) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 886732926 + ... + 886734054.
It is an arithmetic number, because the mean of its divisors is an integer number (10295294400).
Almost surely, 21001122110210 is an apocalyptic number.
1001122110210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1001122110210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1317797683200).
1001122110210 is an abundant number, since it is smaller than the sum of its proper divisors (1634473256190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001122110210 is a wasteful number, since it uses less digits than its factorization.
1001122110210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1985.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1001122110210 its reverse (120112211001), we get a palindrome (1121234321211).
The spelling of 1001122110210 in words is "one trillion, one billion, one hundred twenty-two million, one hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •