Base | Representation |
---|---|
bin | 11101011001101011100… |
… | …11110111001001000011 |
3 | 10120120112222100102002011 |
4 | 32230311303313021003 |
5 | 113022412321232321 |
6 | 2052031054433351 |
7 | 132662124121255 |
oct | 16546563671103 |
9 | 3516488312064 |
10 | 1010220102211 |
11 | 35a482a02a61 |
12 | 143954802857 |
13 | 7435675b0b8 |
14 | 36c75901cd5 |
15 | 1b428aeeae1 |
hex | eb35cf7243 |
1010220102211 has 2 divisors, whose sum is σ = 1010220102212. Its totient is φ = 1010220102210.
The previous prime is 1010220102209. The next prime is 1010220102233. The reversal of 1010220102211 is 1122010220101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1010220102211 - 21 = 1010220102209 is a prime.
It is a super-2 number, since 2×10102201022112 (a number of 25 digits) contains 22 as substring.
Together with 1010220102209, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1010220102191 and 1010220102200.
It is not a weakly prime, because it can be changed into another prime (1010220102271) 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, 505110051105 + 505110051106.
It is an arithmetic number, because the mean of its divisors is an integer number (505110051106).
Almost surely, 21010220102211 is an apocalyptic number.
1010220102211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010220102211 is an equidigital number, since it uses as much as digits as its factorization.
1010220102211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1010220102211 its reverse (1122010220101), we get a palindrome (2132230322312).
The spelling of 1010220102211 in words is "one trillion, ten billion, two hundred twenty million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •