Base | Representation |
---|---|
bin | 10110101111001100010111… |
… | …101000010101011010100010 |
3 | 111010001220210022010021101000 |
4 | 112233030113220111122202 |
5 | 101101400221210032320 |
6 | 552403230530452430 |
7 | 30030525124143021 |
oct | 2657142750253242 |
9 | 433056708107330 |
10 | 100000120002210 |
11 | 299548a381a65a |
12 | b270839a34116 |
13 | 43a4c80c70b7c |
14 | 1a9a062b2c8b8 |
15 | b863750c5c90 |
hex | 5af317a156a2 |
100000120002210 has 64 divisors (see below), whose sum is σ = 282353280019200. Its totient is φ = 25098069332736.
The previous prime is 100000120002199. The next prime is 100000120002239. The reversal of 100000120002210 is 12200021000001.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100000120002192 and 100000120002201.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10893254670 + ... + 10893263849.
It is an arithmetic number, because the mean of its divisors is an integer number (4411770000300).
Almost surely, 2100000120002210 is an apocalyptic number.
100000120002210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100000120002210 is an abundant number, since it is smaller than the sum of its proper divisors (182353160016990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000120002210 is a wasteful number, since it uses less digits than its factorization.
100000120002210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21786518552 (or 21786518546 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 100000120002210 its reverse (12200021000001), we get a palindrome (112200141002211).
The spelling of 100000120002210 in words is "one hundred trillion, one hundred twenty million, two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •