Base | Representation |
---|---|
bin | 100100101111101011011010… |
… | …1100011110110011100000011 |
3 | 1120101101210020100001101002002 |
4 | 1021133112311203312130003 |
5 | 314331002111310000003 |
6 | 3103225351041014215 |
7 | 125036212055143205 |
oct | 11137266543663403 |
9 | 1511353210041062 |
10 | 323212220000003 |
11 | 93a92595079294 |
12 | 3030083a62436b |
13 | 10b46a21139b39 |
14 | 59b57aa996775 |
15 | 27577590d8a88 |
hex | 125f5b58f6703 |
323212220000003 has 2 divisors, whose sum is σ = 323212220000004. Its totient is φ = 323212220000002.
The previous prime is 323212219999961. The next prime is 323212220000011. The reversal of 323212220000003 is 300000022212323.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 323212220000003 - 210 = 323212219998979 is a prime.
It is a super-2 number, since 2×3232122200000032 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 323212220000003.
It is not a weakly prime, because it can be changed into another prime (323212220000063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161606110000001 + 161606110000002.
It is an arithmetic number, because the mean of its divisors is an integer number (161606110000002).
Almost surely, 2323212220000003 is an apocalyptic number.
323212220000003 is a deficient number, since it is larger than the sum of its proper divisors (1).
323212220000003 is an equidigital number, since it uses as much as digits as its factorization.
323212220000003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 323212220000003 its reverse (300000022212323), we get a palindrome (623212242212326).
The spelling of 323212220000003 in words is "three hundred twenty-three trillion, two hundred twelve billion, two hundred twenty million, three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •