Base | Representation |
---|---|
bin | 11101000111100100111… |
… | …001001110101001110001 |
3 | 21002021221010112010020022 |
4 | 131013210321032221301 |
5 | 230241022000000423 |
6 | 4131125142253225 |
7 | 264365434236212 |
oct | 35074471165161 |
9 | 7067833463208 |
10 | 2001000000113 |
11 | 70168a374764 |
12 | 283982a27215 |
13 | 1169027a160a |
14 | 6cbc55db409 |
15 | 370b5baddc8 |
hex | 1d1e4e4ea71 |
2001000000113 has 2 divisors, whose sum is σ = 2001000000114. Its totient is φ = 2001000000112.
The previous prime is 2001000000107. The next prime is 2001000000119. The reversal of 2001000000113 is 3110000001002.
It is a balanced prime because it is at equal distance from previous prime (2001000000107) and next prime (2001000000119).
It can be written as a sum of positive squares in only one way, i.e., 1907304626704 + 93695373409 = 1381052^2 + 306097^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001000000113 - 28 = 2000999999857 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2001000000113.
It is not a weakly prime, because it can be changed into another prime (2001000000119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000500000056 + 1000500000057.
It is an arithmetic number, because the mean of its divisors is an integer number (1000500000057).
Almost surely, 22001000000113 is an apocalyptic number.
It is an amenable number.
2001000000113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001000000113 is an equidigital number, since it uses as much as digits as its factorization.
2001000000113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 8.
Adding to 2001000000113 its reverse (3110000001002), we get a palindrome (5111000001115).
The spelling of 2001000000113 in words is "two trillion, one billion, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •