Base | Representation |
---|---|
bin | 1100001110010100011… |
… | …0000011100011110001 |
3 | 202002001101210221021001 |
4 | 3003211012003203301 |
5 | 11420041003000423 |
6 | 240250143402001 |
7 | 21113021356123 |
oct | 3034506034361 |
9 | 662041727231 |
10 | 210002000113 |
11 | 810747219a4 |
12 | 348492b3301 |
13 | 16a59559b39 |
14 | a242605213 |
15 | 56e15c9cad |
hex | 30e51838f1 |
210002000113 has 2 divisors, whose sum is σ = 210002000114. Its totient is φ = 210002000112.
The previous prime is 210002000099. The next prime is 210002000119. The reversal of 210002000113 is 311000200012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108219945024 + 101782055089 = 328968^2 + 319033^2 .
It is a cyclic number.
It is not a de Polignac number, because 210002000113 - 217 = 210001869041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210002000113.
It is not a weakly prime, because it can be changed into another prime (210002000119) 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, 105001000056 + 105001000057.
It is an arithmetic number, because the mean of its divisors is an integer number (105001000057).
Almost surely, 2210002000113 is an apocalyptic number.
It is an amenable number.
210002000113 is a deficient number, since it is larger than the sum of its proper divisors (1).
210002000113 is an equidigital number, since it uses as much as digits as its factorization.
210002000113 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 10.
Adding to 210002000113 its reverse (311000200012), we get a palindrome (521002200125).
The spelling of 210002000113 in words is "two hundred ten billion, two million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •