Base | Representation |
---|---|
bin | 1100010101101001… |
… | …0100101011101101 |
3 | 22112211010122100121 |
4 | 3011122110223231 |
5 | 23240333341023 |
6 | 1304351524541 |
7 | 145034431462 |
oct | 30532245355 |
9 | 8484118317 |
10 | 3312012013 |
11 | 144a5a9712 |
12 | 785229751 |
13 | 40a22992b |
14 | 235c25669 |
15 | 145b76d5d |
hex | c5694aed |
3312012013 has 2 divisors, whose sum is σ = 3312012014. Its totient is φ = 3312012012.
The previous prime is 3312011993. The next prime is 3312012031. The reversal of 3312012013 is 3102102133.
Together with next prime (3312012031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3131297764 + 180714249 = 55958^2 + 13443^2 .
It is a cyclic number.
It is not a de Polignac number, because 3312012013 - 229 = 2775141101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3312012083) 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, 1656006006 + 1656006007.
It is an arithmetic number, because the mean of its divisors is an integer number (1656006007).
Almost surely, 23312012013 is an apocalyptic number.
It is an amenable number.
3312012013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3312012013 is an equidigital number, since it uses as much as digits as its factorization.
3312012013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 3312012013 is about 57550.0826498103. The cubic root of 3312012013 is about 1490.6097849434.
Adding to 3312012013 its reverse (3102102133), we get a palindrome (6414114146).
The spelling of 3312012013 in words is "three billion, three hundred twelve million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •