Base | Representation |
---|---|
bin | 1001000110001000101101… |
… | …0000000110110010010011 |
3 | 1022102002101021202201200102 |
4 | 2101202023100012302103 |
5 | 2302324042122321321 |
6 | 33134223305443015 |
7 | 2051356413254561 |
oct | 221421320066223 |
9 | 38362337681612 |
10 | 10001020120211 |
11 | 320645514a47a |
12 | 11563214a046b |
13 | 5771275bb753 |
14 | 2680a27d6a31 |
15 | 12523979ac0b |
hex | 9188b406c93 |
10001020120211 has 16 divisors (see below), whose sum is σ = 10037560409184. Its totient is φ = 9964561400064.
The previous prime is 10001020120207. The next prime is 10001020120237. The reversal of 10001020120211 is 11202102010001.
It is a cyclic number.
It is not a de Polignac number, because 10001020120211 - 22 = 10001020120207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10001020120192 and 10001020120201.
It is not an unprimeable number, because it can be changed into a prime (10001020320211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1047551540 + ... + 1047561086.
It is an arithmetic number, because the mean of its divisors is an integer number (627347525574).
Almost surely, 210001020120211 is an apocalyptic number.
10001020120211 is a deficient number, since it is larger than the sum of its proper divisors (36540288973).
10001020120211 is an equidigital number, since it uses as much as digits as its factorization.
10001020120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13430.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10001020120211 its reverse (11202102010001), we get a palindrome (21203122130212).
The spelling of 10001020120211 in words is "ten trillion, one billion, twenty million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •