Base | Representation |
---|---|
bin | 1100111011110000110… |
… | …1100011000100010011 |
3 | 210020112120101100102111 |
4 | 3032330031203010103 |
5 | 12120031424001321 |
6 | 250024442330151 |
7 | 22024230224101 |
oct | 3167415430423 |
9 | 706476340374 |
10 | 222201000211 |
11 | 86264743263 |
12 | 370927b9957 |
13 | 17c519b87a8 |
14 | aa7c824c71 |
15 | 5ba75585e1 |
hex | 33bc363113 |
222201000211 has 2 divisors, whose sum is σ = 222201000212. Its totient is φ = 222201000210.
The previous prime is 222201000193. The next prime is 222201000221. The reversal of 222201000211 is 112000102222.
It is a happy number.
222201000211 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 222201000211 - 27 = 222201000083 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 222201000191 and 222201000200.
It is not a weakly prime, because it can be changed into another prime (222201000221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111100500105 + 111100500106.
It is an arithmetic number, because the mean of its divisors is an integer number (111100500106).
Almost surely, 2222201000211 is an apocalyptic number.
222201000211 is a deficient number, since it is larger than the sum of its proper divisors (1).
222201000211 is an equidigital number, since it uses as much as digits as its factorization.
222201000211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 222201000211 its reverse (112000102222), we get a palindrome (334201102433).
The spelling of 222201000211 in words is "two hundred twenty-two billion, two hundred one million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •