Base | Representation |
---|---|
bin | 1100000001000011010001… |
… | …1111101011000000001101 |
3 | 1201210001222221110112121112 |
4 | 3000100310133223000031 |
5 | 3212432041212322313 |
6 | 44033333445341405 |
7 | 2532356431020344 |
oct | 300206437530015 |
9 | 51701887415545 |
10 | 13212200120333 |
11 | 4234298587975 |
12 | 1594743107865 |
13 | 74ab9c7390b6 |
14 | 33968c538b5b |
15 | 17da2dc0b8a8 |
hex | c04347eb00d |
13212200120333 has 2 divisors, whose sum is σ = 13212200120334. Its totient is φ = 13212200120332.
The previous prime is 13212200120323. The next prime is 13212200120351. The reversal of 13212200120333 is 33302100221231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9475641532009 + 3736558588324 = 3078253^2 + 1933018^2 .
It is a cyclic number.
It is not a de Polignac number, because 13212200120333 - 216 = 13212200054797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13212200120299 and 13212200120308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13212200120303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6606100060166 + 6606100060167.
It is an arithmetic number, because the mean of its divisors is an integer number (6606100060167).
Almost surely, 213212200120333 is an apocalyptic number.
It is an amenable number.
13212200120333 is a deficient number, since it is larger than the sum of its proper divisors (1).
13212200120333 is an equidigital number, since it uses as much as digits as its factorization.
13212200120333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13212200120333 its reverse (33302100221231), we get a palindrome (46514300341564).
The spelling of 13212200120333 in words is "thirteen trillion, two hundred twelve billion, two hundred million, one hundred twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •