Base | Representation |
---|---|
bin | 1001000111010011111011… |
… | …0010110001110001001101 |
3 | 1022111000111111201122212220 |
4 | 2101310332302301301031 |
5 | 2303141420310400023 |
6 | 33151403100045553 |
7 | 2053002660151110 |
oct | 221647662616115 |
9 | 38430444648786 |
10 | 10021212200013 |
11 | 3213a77041933 |
12 | 115a2178338b9 |
13 | 578cc4a09671 |
14 | 26905a3dc577 |
15 | 125a1c3093e3 |
hex | 91d3ecb1c4d |
10021212200013 has 64 divisors (see below), whose sum is σ = 16491190505472. Its totient is φ = 5282933160960.
The previous prime is 10021212200011. The next prime is 10021212200023. The reversal of 10021212200013 is 31000221212001.
It is not a de Polignac number, because 10021212200013 - 21 = 10021212200011 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10021212199965 and 10021212200001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021212200011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3242370 + ... + 5527692.
It is an arithmetic number, because the mean of its divisors is an integer number (257674851648).
Almost surely, 210021212200013 is an apocalyptic number.
It is an amenable number.
10021212200013 is a deficient number, since it is larger than the sum of its proper divisors (6469978305459).
10021212200013 is a wasteful number, since it uses less digits than its factorization.
10021212200013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2285594.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10021212200013 its reverse (31000221212001), we get a palindrome (41021433412014).
The spelling of 10021212200013 in words is "ten trillion, twenty-one billion, two hundred twelve million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •