Base | Representation |
---|---|
bin | 111011101110111… |
… | …101000000000111 |
3 | 2120211202012212202 |
4 | 323232331000013 |
5 | 4023023223411 |
6 | 243235505115 |
7 | 33556153415 |
oct | 7356750007 |
9 | 2524665782 |
10 | 1002164231 |
11 | 474771902 |
12 | 23b75819b |
13 | 12c8172b3 |
14 | 971522b5 |
15 | 5ceac83b |
hex | 3bbbd007 |
1002164231 has 2 divisors, whose sum is σ = 1002164232. Its totient is φ = 1002164230.
The previous prime is 1002164213. The next prime is 1002164237. The reversal of 1002164231 is 1324612001.
Together with previous prime (1002164213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1002164231 - 26 = 1002164167 is a prime.
It is a super-2 number, since 2×10021642312 = 2008666291791642722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1002164237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501082115 + 501082116.
It is an arithmetic number, because the mean of its divisors is an integer number (501082116).
Almost surely, 21002164231 is an apocalyptic number.
1002164231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002164231 is an equidigital number, since it uses as much as digits as its factorization.
1002164231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 1002164231 is about 31656.9776036816. The cubic root of 1002164231 is about 1000.7208905253.
Adding to 1002164231 its reverse (1324612001), we get a palindrome (2326776232).
The spelling of 1002164231 in words is "one billion, two million, one hundred sixty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •