Base | Representation |
---|---|
bin | 111011101010110… |
… | …0001010110000111 |
3 | 12011112100202110111 |
4 | 1313111201112013 |
5 | 13100021132221 |
6 | 530400333451 |
7 | 100420553416 |
oct | 16725412607 |
9 | 5145322414 |
10 | 2002130311 |
11 | 938172155 |
12 | 47a614287 |
13 | 25ba41bbc |
14 | 14dc9147d |
15 | bab83be1 |
hex | 77561587 |
2002130311 has 4 divisors (see below), whose sum is σ = 2002252824. Its totient is φ = 2002007800.
The previous prime is 2002130303. The next prime is 2002130323. The reversal of 2002130311 is 1130312002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2002130311 - 23 = 2002130303 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002130291 and 2002130300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002130371) 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 in 3 ways as a sum of consecutive naturals, for example, 32125 + ... + 70966.
It is an arithmetic number, because the mean of its divisors is an integer number (500563206).
Almost surely, 22002130311 is an apocalyptic number.
2002130311 is a deficient number, since it is larger than the sum of its proper divisors (122513).
2002130311 is a wasteful number, since it uses less digits than its factorization.
2002130311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122512.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 2002130311 is about 44745.1708120552. The cubic root of 2002130311 is about 1260.3682284395.
Adding to 2002130311 its reverse (1130312002), we get a palindrome (3132442313).
The spelling of 2002130311 in words is "two billion, two million, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •