Base | Representation |
---|---|
bin | 1001000110000101101100… |
… | …0110001011000110110100 |
3 | 1022102000021222112122100201 |
4 | 2101201123012023012310 |
5 | 2302320413311210400 |
6 | 33134011205250244 |
7 | 2051330403164530 |
oct | 221413306130664 |
9 | 38360258478321 |
10 | 10000212210100 |
11 | 32060800a6672 |
12 | 1156136a03984 |
13 | 5770290c9328 |
14 | 2680273acbc0 |
15 | 1251dd8b006a |
hex | 9185b18b1b4 |
10000212210100 has 72 divisors (see below), whose sum is σ = 24801276241728. Its totient is φ = 3428540505600.
The previous prime is 10000212210089. The next prime is 10000212210137. The reversal of 10000212210100 is 101221200001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25060140 + ... + 25456060.
It is an arithmetic number, because the mean of its divisors is an integer number (344462170024).
Almost surely, 210000212210100 is an apocalyptic number.
10000212210100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10000212210100 is an abundant number, since it is smaller than the sum of its proper divisors (14801064031628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000212210100 is a wasteful number, since it uses less digits than its factorization.
10000212210100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432025 (or 432018 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10000212210100 its reverse (101221200001), we get a palindrome (10101433410101).
The spelling of 10000212210100 in words is "ten trillion, two hundred twelve million, two hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •