Base | Representation |
---|---|
bin | 111101100001001… |
… | …100110010011101 |
3 | 2122221002210021212 |
4 | 331201030302131 |
5 | 4103210111214 |
6 | 250225434205 |
7 | 34401550463 |
oct | 7541146235 |
9 | 2587083255 |
10 | 1032113309 |
11 | 48a668007 |
12 | 24979b965 |
13 | 135aa2046 |
14 | 9b10a833 |
15 | 6092653e |
hex | 3d84cc9d |
1032113309 has 2 divisors, whose sum is σ = 1032113310. Its totient is φ = 1032113308.
The previous prime is 1032113267. The next prime is 1032113311. The reversal of 1032113309 is 9033112301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1028998084 + 3115225 = 32078^2 + 1765^2 .
It is an emirp because it is prime and its reverse (9033112301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1032113309 - 28 = 1032113053 is a prime.
It is a super-2 number, since 2×10321133092 = 2130515765229858962, which contains 22 as substring.
Together with 1032113311, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032113389) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516056654 + 516056655.
It is an arithmetic number, because the mean of its divisors is an integer number (516056655).
Almost surely, 21032113309 is an apocalyptic number.
It is an amenable number.
1032113309 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032113309 is an equidigital number, since it uses as much as digits as its factorization.
1032113309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
The square root of 1032113309 is about 32126.5203375653. The cubic root of 1032113309 is about 1010.5918528950.
The spelling of 1032113309 in words is "one billion, thirty-two million, one hundred thirteen thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •