Base | Representation |
---|---|
bin | 1011111111110000… |
… | …1000100100101101 |
3 | 22022102101201102121 |
4 | 2333330020210231 |
5 | 23043333241023 |
6 | 1251312152541 |
7 | 142541231134 |
oct | 27774104455 |
9 | 8272351377 |
10 | 3220212013 |
11 | 14027a8a47 |
12 | 75a538751 |
13 | 3c41c75c5 |
14 | 22796a91b |
15 | 13ca91d5d |
hex | bff0892d |
3220212013 has 2 divisors, whose sum is σ = 3220212014. Its totient is φ = 3220212012.
The previous prime is 3220212007. The next prime is 3220212031. The reversal of 3220212013 is 3102120223.
Together with next prime (3220212031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1930899364 + 1289312649 = 43942^2 + 35907^2 .
It is an emirp because it is prime and its reverse (3102120223) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3220212013 - 213 = 3220203821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3220222013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1610106006 + 1610106007.
It is an arithmetic number, because the mean of its divisors is an integer number (1610106007).
Almost surely, 23220212013 is an apocalyptic number.
It is an amenable number.
3220212013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3220212013 is an equidigital number, since it uses as much as digits as its factorization.
3220212013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 3220212013 is about 56746.9119247911. The cubic root of 3220212013 is about 1476.7086605965.
Adding to 3220212013 its reverse (3102120223), we get a palindrome (6322332236).
The spelling of 3220212013 in words is "three billion, two hundred twenty million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •