Base | Representation |
---|---|
bin | 100100101111101011011101… |
… | …0011001100111001011000001 |
3 | 1120101101210102222211212102122 |
4 | 1021133112322121213023001 |
5 | 314331002243101431423 |
6 | 3103225403101254025 |
7 | 125036214062304101 |
oct | 11137267231471301 |
9 | 1511353388755378 |
10 | 323212301202113 |
11 | 93a926269a0674 |
12 | 30300861864315 |
13 | 10b46a34bcb41b |
14 | 59b57b7693201 |
15 | 27577612c88c8 |
hex | 125f5ba6672c1 |
323212301202113 has 2 divisors, whose sum is σ = 323212301202114. Its totient is φ = 323212301202112.
The previous prime is 323212301202097. The next prime is 323212301202163. The reversal of 323212301202113 is 311202103212323.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 239506947424144 + 83705353777969 = 15476012^2 + 9149063^2 .
It is a cyclic number.
It is not a de Polignac number, because 323212301202113 - 24 = 323212301202097 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (323212301202163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161606150601056 + 161606150601057.
It is an arithmetic number, because the mean of its divisors is an integer number (161606150601057).
Almost surely, 2323212301202113 is an apocalyptic number.
It is an amenable number.
323212301202113 is a deficient number, since it is larger than the sum of its proper divisors (1).
323212301202113 is an equidigital number, since it uses as much as digits as its factorization.
323212301202113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 323212301202113 its reverse (311202103212323), we get a palindrome (634414404414436).
The spelling of 323212301202113 in words is "three hundred twenty-three trillion, two hundred twelve billion, three hundred one million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •