Base | Representation |
---|---|
bin | 1001000110000101101010… |
… | …0000000010001100001110 |
3 | 1022102000021021201200200210 |
4 | 2101201122200002030032 |
5 | 2302320403231241420 |
6 | 33134010211103250 |
7 | 2051330222204055 |
oct | 221413240021416 |
9 | 38360237650623 |
10 | 10000202212110 |
11 | 3206075497a70 |
12 | 11561335a1b26 |
13 | 577027008666 |
14 | 268025d2939c |
15 | 1251dca879e0 |
hex | 9185a80230e |
10000202212110 has 32 divisors (see below), whose sum is σ = 26182347610752. Its totient is φ = 2424291445280.
The previous prime is 10000202212109. The next prime is 10000202212111. The reversal of 10000202212110 is 1121220200001.
It is an interprime number because it is at equal distance from previous prime (10000202212109) and next prime (10000202212111).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000202212111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15151821204 + ... + 15151821863.
It is an arithmetic number, because the mean of its divisors is an integer number (818198362836).
Almost surely, 210000202212110 is an apocalyptic number.
10000202212110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10000202212110 is an abundant number, since it is smaller than the sum of its proper divisors (16182145398642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000202212110 is a wasteful number, since it uses less digits than its factorization.
10000202212110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30303643088.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10000202212110 its reverse (1121220200001), we get a palindrome (11121422412111).
The spelling of 10000202212110 in words is "ten trillion, two hundred two million, two hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •