Base | Representation |
---|---|
bin | 11000101000001011… |
… | …11110010100110011 |
3 | 1021010110112210221222 |
4 | 30110011332110303 |
5 | 204034313342321 |
6 | 10024001335255 |
7 | 645440151362 |
oct | 142405762463 |
9 | 37113483858 |
10 | 13222012211 |
11 | 5675532521 |
12 | 269003752b |
13 | 1329395285 |
14 | 8d603b7d9 |
15 | 525ba83ab |
hex | 31417e533 |
13222012211 has 2 divisors, whose sum is σ = 13222012212. Its totient is φ = 13222012210.
The previous prime is 13222012189. The next prime is 13222012217. The reversal of 13222012211 is 11221022231.
13222012211 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 an emirp because it is prime and its reverse (11221022231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13222012211 - 218 = 13221750067 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13222012211.
It is not a weakly prime, because it can be changed into another prime (13222012217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6611006105 + 6611006106.
It is an arithmetic number, because the mean of its divisors is an integer number (6611006106).
Almost surely, 213222012211 is an apocalyptic number.
13222012211 is a deficient number, since it is larger than the sum of its proper divisors (1).
13222012211 is an equidigital number, since it uses as much as digits as its factorization.
13222012211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 13222012211 its reverse (11221022231), we get a palindrome (24443034442).
The spelling of 13222012211 in words is "thirteen billion, two hundred twenty-two million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •