Base | Representation |
---|---|
bin | 10011010100110… |
… | …110011110011001 |
3 | 211121002202012211 |
4 | 103110312132121 |
5 | 1131000424423 |
6 | 52101235121 |
7 | 11014636021 |
oct | 2324663631 |
9 | 747082184 |
10 | 324233113 |
11 | 157026156 |
12 | 90702aa1 |
13 | 52233c19 |
14 | 310c0a81 |
15 | 1d6e910d |
hex | 13536799 |
324233113 has 2 divisors, whose sum is σ = 324233114. Its totient is φ = 324233112.
The previous prime is 324233101. The next prime is 324233131. The reversal of 324233113 is 311332423.
Together with next prime (324233131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 162129289 + 162103824 = 12733^2 + 12732^2 .
It is a cyclic number.
It is not a de Polignac number, because 324233113 - 225 = 290678681 is a prime.
It is a super-2 number, since 2×3242331132 = 210254223131341538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (324233153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 162116556 + 162116557.
It is an arithmetic number, because the mean of its divisors is an integer number (162116557).
Almost surely, 2324233113 is an apocalyptic number.
324233113 is the 12733-rd centered square number.
It is an amenable number.
324233113 is a deficient number, since it is larger than the sum of its proper divisors (1).
324233113 is an equidigital number, since it uses as much as digits as its factorization.
324233113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1296, while the sum is 22.
The square root of 324233113 is about 18006.4741967993. The cubic root of 324233113 is about 686.9932268895.
Adding to 324233113 its reverse (311332423), we get a palindrome (635565536).
The spelling of 324233113 in words is "three hundred twenty-four million, two hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •