Base | Representation |
---|---|
bin | 10111110101111… |
… | …00010111101101 |
3 | 111221100002210122 |
4 | 23322330113231 |
5 | 402200013010 |
6 | 31502414325 |
7 | 4645660211 |
oct | 1372742755 |
9 | 457302718 |
10 | 200001005 |
11 | a2993796 |
12 | 56b913a5 |
13 | 325878b9 |
14 | 1c7c2941 |
15 | 12859855 |
hex | bebc5ed |
200001005 has 24 divisors (see below), whose sum is σ = 259243080. Its totient is φ = 148055040.
The previous prime is 200001001. The next prime is 200001007. The reversal of 200001005 is 500100002.
It can be written as a sum of positive squares in 12 ways, for example, as 94692361 + 105308644 = 9731^2 + 10262^2 .
It is not a de Polignac number, because 200001005 - 22 = 200001001 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200000983 and 200001001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200001001) 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 in 23 ways as a sum of consecutive naturals, for example, 87011 + ... + 89279.
It is an arithmetic number, because the mean of its divisors is an integer number (10801795).
Almost surely, 2200001005 is an apocalyptic number.
It is an amenable number.
200001005 is a deficient number, since it is larger than the sum of its proper divisors (59242075).
200001005 is a wasteful number, since it uses less digits than its factorization.
200001005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2369 (or 2352 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 8.
The square root of 200001005 is about 14142.1711558021. The cubic root of 200001005 is about 584.8045271869.
Adding to 200001005 its reverse (500100002), we get a palindrome (700101007).
The spelling of 200001005 in words is "two hundred million, one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •