Base | Representation |
---|---|
bin | 1100000001000011101010… |
… | …0001010110000010010001 |
3 | 1201210002020222201001001221 |
4 | 3000100322201112002101 |
5 | 3212432243103101113 |
6 | 44033351500325041 |
7 | 2532362066251444 |
oct | 300207241260221 |
9 | 51702228631057 |
10 | 13212301222033 |
11 | 423433a6610a1 |
12 | 1594770b43781 |
13 | 74abb76771a4 |
14 | 33969bb3565b |
15 | 17da37a2c98d |
hex | c043a856091 |
13212301222033 has 2 divisors, whose sum is σ = 13212301222034. Its totient is φ = 13212301222032.
The previous prime is 13212301221989. The next prime is 13212301222051. The reversal of 13212301222033 is 33022210321231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11997958933249 + 1214342288784 = 3463807^2 + 1101972^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13212301222033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13212301221989 and 13212301222007.
It is not a weakly prime, because it can be changed into another prime (13212301229033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6606150611016 + 6606150611017.
It is an arithmetic number, because the mean of its divisors is an integer number (6606150611017).
Almost surely, 213212301222033 is an apocalyptic number.
It is an amenable number.
13212301222033 is a deficient number, since it is larger than the sum of its proper divisors (1).
13212301222033 is an equidigital number, since it uses as much as digits as its factorization.
13212301222033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13212301222033 its reverse (33022210321231), we get a palindrome (46234511543264).
The spelling of 13212301222033 in words is "thirteen trillion, two hundred twelve billion, three hundred one million, two hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •