Base | Representation |
---|---|
bin | 111011101010100… |
… | …0001100010011111 |
3 | 12011112010010202022 |
4 | 1313111001202133 |
5 | 13100003000111 |
6 | 530353450355 |
7 | 100416501533 |
oct | 16725014237 |
9 | 5145103668 |
10 | 2002000031 |
11 | 938093289 |
12 | 47a5709bb |
13 | 25b9c7805 |
14 | 14dc59bc3 |
15 | bab5a2db |
hex | 7754189f |
2002000031 has 2 divisors, whose sum is σ = 2002000032. Its totient is φ = 2002000030.
The previous prime is 2002000027. The next prime is 2002000069. The reversal of 2002000031 is 1300002002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2002000031 - 22 = 2002000027 is a prime.
It is a super-3 number, since 3×20020000313 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 2001999982 and 2002000018.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002000081) 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, 1001000015 + 1001000016.
It is an arithmetic number, because the mean of its divisors is an integer number (1001000016).
Almost surely, 22002000031 is an apocalyptic number.
2002000031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002000031 is an equidigital number, since it uses as much as digits as its factorization.
2002000031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 8.
The square root of 2002000031 is about 44743.7149888116. The cubic root of 2002000031 is about 1260.3408901699.
Adding to 2002000031 its reverse (1300002002), we get a palindrome (3302002033).
The spelling of 2002000031 in words is "two billion, two million, thirty-one", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •