Base | Representation |
---|---|
bin | 11101000111000001001… |
… | …00101010111011111111 |
3 | 10112121200122222200102002 |
4 | 32203200210222323333 |
5 | 112341402212401421 |
6 | 2043252515452515 |
7 | 132155614522301 |
oct | 16434044527377 |
9 | 3477618880362 |
10 | 1000200122111 |
11 | 356200991673 |
12 | 141a18bb713b |
13 | 7341a8965a8 |
14 | 365a4c5b971 |
15 | 1b03e0e6b0b |
hex | e8e092aeff |
1000200122111 has 2 divisors, whose sum is σ = 1000200122112. Its totient is φ = 1000200122110.
The previous prime is 1000200122099. The next prime is 1000200122149. The reversal of 1000200122111 is 1112210020001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1000200122111 - 226 = 1000133013247 is a prime.
It is a super-2 number, since 2×10002001221112 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000200122092 and 1000200122101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000200128111) 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, 500100061055 + 500100061056.
It is an arithmetic number, because the mean of its divisors is an integer number (500100061056).
Almost surely, 21000200122111 is an apocalyptic number.
1000200122111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000200122111 is an equidigital number, since it uses as much as digits as its factorization.
1000200122111 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 11.
Adding to 1000200122111 its reverse (1112210020001), we get a palindrome (2112410142112).
The spelling of 1000200122111 in words is "one trillion, two hundred million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •