Base | Representation |
---|---|
bin | 10111110101111… |
… | …00010111110101 |
3 | 111221100002210221 |
4 | 23322330113311 |
5 | 402200013023 |
6 | 31502414341 |
7 | 4645660222 |
oct | 1372742765 |
9 | 457302727 |
10 | 200001013 |
11 | a29937a3 |
12 | 56b913b1 |
13 | 325878c4 |
14 | 1c7c2949 |
15 | 1285985d |
hex | bebc5f5 |
200001013 has 2 divisors, whose sum is σ = 200001014. Its totient is φ = 200001012.
The previous prime is 200001007. The next prime is 200001019. The reversal of 200001013 is 310100002.
It is a balanced prime because it is at equal distance from previous prime (200001007) and next prime (200001019).
It can be written as a sum of positive squares in only one way, i.e., 102050404 + 97950609 = 10102^2 + 9897^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200001013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200000987 and 200001005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200001019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100000506 + 100000507.
It is an arithmetic number, because the mean of its divisors is an integer number (100000507).
Almost surely, 2200001013 is an apocalyptic number.
It is an amenable number.
200001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
200001013 is an equidigital number, since it uses as much as digits as its factorization.
200001013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 7.
The square root of 200001013 is about 14142.1714386441. The cubic root of 200001013 is about 584.8045349842.
Adding to 200001013 its reverse (310100002), we get a palindrome (510101015).
The spelling of 200001013 in words is "two hundred million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •