Base | Representation |
---|---|
bin | 100100101111101011110010… |
… | …0101101010010001100010011 |
3 | 1120101101212021110110110000012 |
4 | 1021133113210231102030103 |
5 | 314331010221304032011 |
6 | 3103230001334545135 |
7 | 125036240501432645 |
oct | 11137274455221423 |
9 | 1511355243413005 |
10 | 323213011002131 |
11 | 93a92960623958 |
12 | 30300a1b5081ab |
13 | 10b46b18c8c333 |
14 | 59b5843a5c895 |
15 | 27577a3784a8b |
hex | 125f5e4b52313 |
323213011002131 has 2 divisors, whose sum is σ = 323213011002132. Its totient is φ = 323213011002130.
The previous prime is 323213011002121. The next prime is 323213011002143. The reversal of 323213011002131 is 131200110312323.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 323213011002131 - 218 = 323213010739987 is a prime.
It is a super-2 number, since 2×3232130110021312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 323213011002097 and 323213011002106.
It is not a weakly prime, because it can be changed into another prime (323213011002121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161606505501065 + 161606505501066.
It is an arithmetic number, because the mean of its divisors is an integer number (161606505501066).
Almost surely, 2323213011002131 is an apocalyptic number.
323213011002131 is a deficient number, since it is larger than the sum of its proper divisors (1).
323213011002131 is an equidigital number, since it uses as much as digits as its factorization.
323213011002131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 323213011002131 its reverse (131200110312323), we get a palindrome (454413121314454).
The spelling of 323213011002131 in words is "three hundred twenty-three trillion, two hundred thirteen billion, eleven million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •