Base | Representation |
---|---|
bin | 1011101001000011111… |
… | …1010001001001000001 |
3 | 201010020102011111020111 |
4 | 2322100333101021001 |
5 | 11234100224000001 |
6 | 231513523311321 |
7 | 20310132310315 |
oct | 2722077211101 |
9 | 633212144214 |
10 | 200001000001 |
11 | 77902394550 |
12 | 32917b1b541 |
13 | 15b245ac3aa |
14 | 99742a1b45 |
15 | 53085c0851 |
hex | 2e90fd1241 |
200001000001 has 4 divisors (see below), whose sum is σ = 218182909104. Its totient is φ = 181819090900.
The previous prime is 200000999993. The next prime is 200001000007. The reversal of 200001000001 is 100000100002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 200001000001 - 23 = 200000999993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200001000007) 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 in 3 ways as a sum of consecutive naturals, for example, 9090954535 + ... + 9090954556.
It is an arithmetic number, because the mean of its divisors is an integer number (54545727276).
Almost surely, 2200001000001 is an apocalyptic number.
200001000001 is the 200001-st centered decagonal number.
It is an amenable number.
200001000001 is a deficient number, since it is larger than the sum of its proper divisors (18181909103).
200001000001 is a wasteful number, since it uses less digits than its factorization.
200001000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18181909102.
The product of its (nonzero) digits is 2, while the sum is 4.
Adding to 200001000001 its reverse (100000100002), we get a palindrome (300001100003).
The spelling of 200001000001 in words is "two hundred billion, one million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •