Base | Representation |
---|---|
bin | 11101011001101001010… |
… | …11000100111100000011 |
3 | 10120120111122110001020111 |
4 | 32230310223010330003 |
5 | 113022342430202321 |
6 | 2052025133452151 |
7 | 132661503003403 |
oct | 16546453047403 |
9 | 3516448401214 |
10 | 1010201022211 |
11 | 35a473160967 |
12 | 14394a341057 |
13 | 7435280a664 |
14 | 36c73176803 |
15 | 1b4270d15e1 |
hex | eb34ac4f03 |
1010201022211 has 2 divisors, whose sum is σ = 1010201022212. Its totient is φ = 1010201022210.
The previous prime is 1010201022151. The next prime is 1010201022223. The reversal of 1010201022211 is 1122201020101.
1010201022211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1010201022211 - 29 = 1010201021699 is a prime.
It is a super-2 number, since 2×10102010222112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010201022191 and 1010201022200.
It is not a weakly prime, because it can be changed into another prime (1010201022811) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505100511105 + 505100511106.
It is an arithmetic number, because the mean of its divisors is an integer number (505100511106).
Almost surely, 21010201022211 is an apocalyptic number.
1010201022211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010201022211 is an equidigital number, since it uses as much as digits as its factorization.
1010201022211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1010201022211 its reverse (1122201020101), we get a palindrome (2132402042312).
The spelling of 1010201022211 in words is "one trillion, ten billion, two hundred one million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •