Base | Representation |
---|---|
bin | 11101000110101010011… |
… | …111100101101001000001 |
3 | 21002012101211212010011021 |
4 | 131012222133211221001 |
5 | 230232020132400001 |
6 | 4130444021545441 |
7 | 264332236126135 |
oct | 35065237455101 |
9 | 7065354763137 |
10 | 2000020200001 |
11 | 7012272983aa |
12 | 28374a875281 |
13 | 1167a77b7835 |
14 | 6cb3142b3c5 |
15 | 37059b6cba1 |
hex | 1d1aa7e5a41 |
2000020200001 has 4 divisors (see below), whose sum is σ = 2015287529904. Its totient is φ = 1984752870100.
The previous prime is 2000020199959. The next prime is 2000020200089. The reversal of 2000020200001 is 1000020200002.
It is a happy number.
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 2000020200001 - 27 = 2000020199873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2000020200091) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7633664755 + ... + 7633665016.
It is an arithmetic number, because the mean of its divisors is an integer number (503821882476).
Almost surely, 22000020200001 is an apocalyptic number.
It is an amenable number.
2000020200001 is a deficient number, since it is larger than the sum of its proper divisors (15267329903).
2000020200001 is a wasteful number, since it uses less digits than its factorization.
2000020200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15267329902.
The product of its (nonzero) digits is 8, while the sum is 7.
Adding to 2000020200001 its reverse (1000020200002), we get a palindrome (3000040400003).
Subtracting from 2000020200001 its reverse (1000020200002), we obtain a palindrome (999999999999).
The spelling of 2000020200001 in words is "two trillion, twenty million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •