Base | Representation |
---|---|
bin | 111011101010101… |
… | …1100110000011001 |
3 | 12011112022210200021 |
4 | 1313111130300121 |
5 | 13100020032023 |
6 | 530400110441 |
7 | 100420444543 |
oct | 16725346031 |
9 | 5145283607 |
10 | 2002111513 |
11 | 93815a016 |
12 | 47a605421 |
13 | 25ba3648c |
14 | 14dc88693 |
15 | bab7d35d |
hex | 7755cc19 |
2002111513 has 4 divisors (see below), whose sum is σ = 2019829428. Its totient is φ = 1984393600.
The previous prime is 2002111511. The next prime is 2002111537. The reversal of 2002111513 is 3151112002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 554461209 + 1447650304 = 23547^2 + 38048^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002111513 - 21 = 2002111511 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002111511) 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, 8858788 + ... + 8859013.
It is an arithmetic number, because the mean of its divisors is an integer number (504957357).
Almost surely, 22002111513 is an apocalyptic number.
It is an amenable number.
2002111513 is a deficient number, since it is larger than the sum of its proper divisors (17717915).
2002111513 is a wasteful number, since it uses less digits than its factorization.
2002111513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17717914.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 2002111513 is about 44744.9607553745. The cubic root of 2002111513 is about 1260.3642838950.
Adding to 2002111513 its reverse (3151112002), we get a palindrome (5153223515).
The spelling of 2002111513 in words is "two billion, two million, one hundred eleven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •