Base | Representation |
---|---|
bin | 1011101001000100010… |
… | …0001111000000111101 |
3 | 201010020111121122021011 |
4 | 2322101010033000331 |
5 | 11234101042131023 |
6 | 231514011235221 |
7 | 20310146342263 |
oct | 2722104170075 |
9 | 633214548234 |
10 | 200002302013 |
11 | 779030a3798 |
12 | 32918448b11 |
13 | 15b24946c07 |
14 | 9974520433 |
15 | 530877b50d |
hex | 2e9110f03d |
200002302013 has 2 divisors, whose sum is σ = 200002302014. Its totient is φ = 200002302012.
The previous prime is 200002301999. The next prime is 200002302023. The reversal of 200002302013 is 310203200002.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134206460964 + 65795841049 = 366342^2 + 256507^2 .
It is a cyclic number.
It is not a de Polignac number, because 200002302013 - 217 = 200002170941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200002301984 and 200002302002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200002302023) 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, 100001151006 + 100001151007.
It is an arithmetic number, because the mean of its divisors is an integer number (100001151007).
Almost surely, 2200002302013 is an apocalyptic number.
It is an amenable number.
200002302013 is a deficient number, since it is larger than the sum of its proper divisors (1).
200002302013 is an equidigital number, since it uses as much as digits as its factorization.
200002302013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 200002302013 its reverse (310203200002), we get a palindrome (510205502015).
The spelling of 200002302013 in words is "two hundred billion, two million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •