Base | Representation |
---|---|
bin | 1011000111011010100100… |
… | …1010101010010001011011 |
3 | 1121021102011121001211102222 |
4 | 2301312221022222101123 |
5 | 3100221144121214321 |
6 | 41554415111214255 |
7 | 2401004023515224 |
oct | 261665112522133 |
9 | 47242147054388 |
10 | 12222020101211 |
11 | 39923697a0a58 |
12 | 145486197738b |
13 | 6a86baa7b23b |
14 | 30379839424b |
15 | 162dc96443ab |
hex | b1da92aa45b |
12222020101211 has 2 divisors, whose sum is σ = 12222020101212. Its totient is φ = 12222020101210.
The previous prime is 12222020101183. The next prime is 12222020101229. The reversal of 12222020101211 is 11210102022221.
12222020101211 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 a de Polignac number, because none of the positive numbers 2k-12222020101211 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12222020101211.
It is not a weakly prime, because it can be changed into another prime (12222020101231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6111010050605 + 6111010050606.
It is an arithmetic number, because the mean of its divisors is an integer number (6111010050606).
Almost surely, 212222020101211 is an apocalyptic number.
12222020101211 is a deficient number, since it is larger than the sum of its proper divisors (1).
12222020101211 is an equidigital number, since it uses as much as digits as its factorization.
12222020101211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12222020101211 its reverse (11210102022221), we get a palindrome (23432122123432).
The spelling of 12222020101211 in words is "twelve trillion, two hundred twenty-two billion, twenty million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •