Base | Representation |
---|---|
bin | 110000001100110101110… |
… | …010111010001110111101 |
3 | 102201122200102211012002222 |
4 | 300030311302322032331 |
5 | 413232114003322024 |
6 | 11013354310455125 |
7 | 461210302126502 |
oct | 60146562721675 |
9 | 12648612735088 |
10 | 3312322323389 |
11 | 1067825665a12 |
12 | 455b4a0644a5 |
13 | 1b0473508c11 |
14 | b646279b4a9 |
15 | 5b263ae185e |
hex | 30335cba3bd |
3312322323389 has 2 divisors, whose sum is σ = 3312322323390. Its totient is φ = 3312322323388.
The previous prime is 3312322323313. The next prime is 3312322323407. The reversal of 3312322323389 is 9833232232133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2123912743225 + 1188409580164 = 1457365^2 + 1090142^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3312322323389 is a prime.
It is a super-2 number, since 2×33123223233892 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3312322323589) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1656161161694 + 1656161161695.
It is an arithmetic number, because the mean of its divisors is an integer number (1656161161695).
Almost surely, 23312322323389 is an apocalyptic number.
It is an amenable number.
3312322323389 is a deficient number, since it is larger than the sum of its proper divisors (1).
3312322323389 is an equidigital number, since it uses as much as digits as its factorization.
3312322323389 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 839808, while the sum is 44.
The spelling of 3312322323389 in words is "three trillion, three hundred twelve billion, three hundred twenty-two million, three hundred twenty-three thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •