Base | Representation |
---|---|
bin | 100100101111000110000100… |
… | …1010001100000110010000111 |
3 | 1120101010010020001210100010212 |
4 | 1021132030021101200302013 |
5 | 314323143334121201411 |
6 | 3103124444542510035 |
7 | 125030342455222346 |
oct | 11136141121406207 |
9 | 1511103201710125 |
10 | 323132020100231 |
11 | 93a6157a348591 |
12 | 302a919789531b |
13 | 10b3c2ac784544 |
14 | 59b195d463b5d |
15 | 27556132d068b |
hex | 125e309460c87 |
323132020100231 has 2 divisors, whose sum is σ = 323132020100232. Its totient is φ = 323132020100230.
The previous prime is 323132020100027. The next prime is 323132020100243. The reversal of 323132020100231 is 132001020231323.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 323132020100231 - 234 = 323114840231047 is a prime.
It is a super-2 number, since 2×3231320201002312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 323132020100197 and 323132020100206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (323132020100291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161566010050115 + 161566010050116.
It is an arithmetic number, because the mean of its divisors is an integer number (161566010050116).
Almost surely, 2323132020100231 is an apocalyptic number.
323132020100231 is a deficient number, since it is larger than the sum of its proper divisors (1).
323132020100231 is an equidigital number, since it uses as much as digits as its factorization.
323132020100231 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 323132020100231 its reverse (132001020231323), we get a palindrome (455133040331554).
The spelling of 323132020100231 in words is "three hundred twenty-three trillion, one hundred thirty-two billion, twenty million, one hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •