Base | Representation |
---|---|
bin | 111011101110110… |
… | …010010011000101 |
3 | 2120211122222201222 |
4 | 323232302103011 |
5 | 4023020323024 |
6 | 243234530125 |
7 | 33555611534 |
oct | 7356622305 |
9 | 2524588658 |
10 | 1002120389 |
11 | 474741976 |
12 | 23b736945 |
13 | 12c80035a |
14 | 9714031b |
15 | 5ce9e85e |
hex | 3bbb24c5 |
1002120389 has 2 divisors, whose sum is σ = 1002120390. Its totient is φ = 1002120388.
The previous prime is 1002120313. The next prime is 1002120391. The reversal of 1002120389 is 9830212001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 872729764 + 129390625 = 29542^2 + 11375^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1002120389 is a prime.
It is a super-2 number, since 2×10021203892 = 2008490548099022642, which contains 22 as substring.
Together with 1002120391, 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 (1002120589) 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, 501060194 + 501060195.
It is an arithmetic number, because the mean of its divisors is an integer number (501060195).
Almost surely, 21002120389 is an apocalyptic number.
It is an amenable number.
1002120389 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002120389 is an equidigital number, since it uses as much as digits as its factorization.
1002120389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The square root of 1002120389 is about 31656.2851421325. The cubic root of 1002120389 is about 1000.7062973599.
The spelling of 1002120389 in words is "one billion, two million, one hundred twenty thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •