Base | Representation |
---|---|
bin | 10011001110100111… |
… | …11001000010110111 |
3 | 222122102221000020101 |
4 | 21213103321002313 |
5 | 132120214432411 |
6 | 4424210014531 |
7 | 513550525336 |
oct | 114723710267 |
9 | 28572830211 |
10 | 10323202231 |
11 | 44181a66a1 |
12 | 2001277447 |
13 | c869500b4 |
14 | 6dd055d1d |
15 | 4064518c1 |
hex | 2674f90b7 |
10323202231 has 2 divisors, whose sum is σ = 10323202232. Its totient is φ = 10323202230.
The previous prime is 10323202163. The next prime is 10323202243. The reversal of 10323202231 is 13220232301.
It is a strong prime.
It is an emirp because it is prime and its reverse (13220232301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10323202231 - 27 = 10323202103 is a prime.
It is a super-2 number, since 2×103232022312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10323202199 and 10323202208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10323202271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5161601115 + 5161601116.
It is an arithmetic number, because the mean of its divisors is an integer number (5161601116).
Almost surely, 210323202231 is an apocalyptic number.
10323202231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10323202231 is an equidigital number, since it uses as much as digits as its factorization.
10323202231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 10323202231 its reverse (13220232301), we get a palindrome (23543434532).
The spelling of 10323202231 in words is "ten billion, three hundred twenty-three million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •