Base | Representation |
---|---|
bin | 11101000110101011111… |
… | …01001100011000111011 |
3 | 10112121020020211012110201 |
4 | 32203111331030120323 |
5 | 112341021113014321 |
6 | 2043223114023031 |
7 | 132151322521342 |
oct | 16432575143073 |
9 | 3477206735421 |
10 | 1000022001211 |
11 | 35611a392812 |
12 | 141989417a77 |
13 | 733bc9ccacc |
14 | 36589332b59 |
15 | 1b02d660291 |
hex | e8d5f4c63b |
1000022001211 has 2 divisors, whose sum is σ = 1000022001212. Its totient is φ = 1000022001210.
The previous prime is 1000022001193. The next prime is 1000022001221. The reversal of 1000022001211 is 1121002200001.
It is an a-pointer prime, because the next prime (1000022001221) can be obtained adding 1000022001211 to its sum of digits (10).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1000022001211 - 229 = 999485130299 is a prime.
It is not a weakly prime, because it can be changed into another prime (1000022001221) 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 as a sum of consecutive naturals, namely, 500011000605 + 500011000606.
It is an arithmetic number, because the mean of its divisors is an integer number (500011000606).
Almost surely, 21000022001211 is an apocalyptic number.
1000022001211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000022001211 is an equidigital number, since it uses as much as digits as its factorization.
1000022001211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1000022001211 its reverse (1121002200001), we get a palindrome (2121024201212).
The spelling of 1000022001211 in words is "one trillion, twenty-two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •