Base | Representation |
---|---|
bin | 110000000001101100000001… |
… | …100001100011001011001011 |
3 | 1000200212122110211121021011111 |
4 | 300001230001201203023023 |
5 | 210141131102342101102 |
6 | 2025122052130311151 |
7 | 62330205400313362 |
oct | 6001540141431313 |
9 | 1020778424537144 |
10 | 211222222222027 |
11 | 6133592898a805 |
12 | 1b834346a284b7 |
13 | 90b22298bbcb3 |
14 | 3a232d27467d9 |
15 | 1964594a94cd7 |
hex | c01b018632cb |
211222222222027 has 2 divisors, whose sum is σ = 211222222222028. Its totient is φ = 211222222222026.
The previous prime is 211222222222019. The next prime is 211222222222031. The reversal of 211222222222027 is 720222222222112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211222222222027 - 23 = 211222222222019 is a prime.
It is a super-2 number, since 2×2112222222220272 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 211222222222027.
It is not a weakly prime, because it can be changed into another prime (211222222222007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105611111111013 + 105611111111014.
It is an arithmetic number, because the mean of its divisors is an integer number (105611111111014).
Almost surely, 2211222222222027 is an apocalyptic number.
211222222222027 is a deficient number, since it is larger than the sum of its proper divisors (1).
211222222222027 is an equidigital number, since it uses as much as digits as its factorization.
211222222222027 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14336, while the sum is 31.
Adding to 211222222222027 its reverse (720222222222112), we get a palindrome (931444444444139).
The spelling of 211222222222027 in words is "two hundred eleven trillion, two hundred twenty-two billion, two hundred twenty-two million, two hundred twenty-two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •