Base | Representation |
---|---|
bin | 11101000110110101011… |
… | …11001101000101001111 |
3 | 10112121102211202202010002 |
4 | 32203122233031011033 |
5 | 112341202132020421 |
6 | 2043235101234515 |
7 | 132153315415601 |
oct | 16433257150517 |
9 | 3477384682102 |
10 | 1000102220111 |
11 | 3561606a3425 |
12 | 1419b0262a3b |
13 | 73403508a07 |
14 | 36595c55171 |
15 | 1b035708b0b |
hex | e8dabcd14f |
1000102220111 has 2 divisors, whose sum is σ = 1000102220112. Its totient is φ = 1000102220110.
The previous prime is 1000102220071. The next prime is 1000102220123. The reversal of 1000102220111 is 1110222010001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000102220111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000102220092 and 1000102220101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000102250111) 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, 500051110055 + 500051110056.
It is an arithmetic number, because the mean of its divisors is an integer number (500051110056).
Almost surely, 21000102220111 is an apocalyptic number.
1000102220111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000102220111 is an equidigital number, since it uses as much as digits as its factorization.
1000102220111 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 1000102220111 its reverse (1110222010001), we get a palindrome (2110324230112).
The spelling of 1000102220111 in words is "one trillion, one hundred two million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •