Base | Representation |
---|---|
bin | 111011101010101… |
… | …1100011010100001 |
3 | 12011112022201202102 |
4 | 1313111130122201 |
5 | 13100020010423 |
6 | 530400100145 |
7 | 100420440503 |
oct | 16725343241 |
9 | 5145281672 |
10 | 2002110113 |
11 | 938158a63 |
12 | 47a604655 |
13 | 25ba35953 |
14 | 14dc87d73 |
15 | bab7cc28 |
hex | 7755c6a1 |
2002110113 has 2 divisors, whose sum is σ = 2002110114. Its totient is φ = 2002110112.
The previous prime is 2002110109. The next prime is 2002110119. The reversal of 2002110113 is 3110112002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1558038784 + 444071329 = 39472^2 + 21073^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002110113 - 22 = 2002110109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002110094 and 2002110103.
It is not a weakly prime, because it can be changed into another prime (2002110119) 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, 1001055056 + 1001055057.
It is an arithmetic number, because the mean of its divisors is an integer number (1001055057).
Almost surely, 22002110113 is an apocalyptic number.
It is an amenable number.
2002110113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002110113 is an equidigital number, since it uses as much as digits as its factorization.
2002110113 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 11.
The square root of 2002110113 is about 44744.9451111519. The cubic root of 2002110113 is about 1260.3639901201.
Adding to 2002110113 its reverse (3110112002), we get a palindrome (5112222115).
The spelling of 2002110113 in words is "two billion, two million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •