Base | Representation |
---|---|
bin | 111011101010110… |
… | …0001110101011001 |
3 | 12011112100212012122 |
4 | 1313111201311121 |
5 | 13100021213223 |
6 | 530400351025 |
7 | 100420562306 |
oct | 16725416531 |
9 | 5145325178 |
10 | 2002132313 |
11 | 938173705 |
12 | 47a615475 |
13 | 25ba42a9c |
14 | 14dc920ad |
15 | bab845c8 |
hex | 77561d59 |
2002132313 has 16 divisors (see below), whose sum is σ = 2240110080. Its totient is φ = 1779588096.
The previous prime is 2002132291. The next prime is 2002132361. The reversal of 2002132313 is 3132312002.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002132313 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002132291 and 2002132300.
It is not an unprimeable number, because it can be changed into a prime (2002132513) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1520 + ... + 63297.
It is an arithmetic number, because the mean of its divisors is an integer number (140006880).
Almost surely, 22002132313 is an apocalyptic number.
2002132313 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2002132313 is a deficient number, since it is larger than the sum of its proper divisors (237977767).
2002132313 is a wasteful number, since it uses less digits than its factorization.
2002132313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64936.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 2002132313 is about 44745.1931831789. The cubic root of 2002132313 is about 1260.3686485348.
Adding to 2002132313 its reverse (3132312002), we get a palindrome (5134444315).
The spelling of 2002132313 in words is "two billion, two million, one hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •