Base | Representation |
---|---|
bin | 10011010000100… |
… | …101010001110101 |
3 | 211111222220012221 |
4 | 103100211101311 |
5 | 1130204122401 |
6 | 52021242341 |
7 | 11002265422 |
oct | 2320452165 |
9 | 744886187 |
10 | 323114101 |
11 | 156431452 |
12 | 902633b1 |
13 | 51c3179b |
14 | 30cacd49 |
15 | 1d5777a1 |
hex | 13425475 |
323114101 has 2 divisors, whose sum is σ = 323114102. Its totient is φ = 323114100.
The previous prime is 323114069. The next prime is 323114117. The reversal of 323114101 is 101411323.
It is an a-pointer prime, because the next prime (323114117) can be obtained adding 323114101 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 161951076 + 161163025 = 12726^2 + 12695^2 .
It is a cyclic number.
It is not a de Polignac number, because 323114101 - 25 = 323114069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (323114131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161557050 + 161557051.
It is an arithmetic number, because the mean of its divisors is an integer number (161557051).
Almost surely, 2323114101 is an apocalyptic number.
It is an amenable number.
323114101 is a deficient number, since it is larger than the sum of its proper divisors (1).
323114101 is an equidigital number, since it uses as much as digits as its factorization.
323114101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 323114101 is about 17975.3748500553. The cubic root of 323114101 is about 686.2019857294.
Adding to 323114101 its reverse (101411323), we get a palindrome (424525424).
The spelling of 323114101 in words is "three hundred twenty-three million, one hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •