Base | Representation |
---|---|
bin | 111011100110101… |
… | …1110001010000101 |
3 | 12011101101112210120 |
4 | 1313031132022011 |
5 | 13044001120401 |
6 | 530243212153 |
7 | 100363614252 |
oct | 16715361205 |
9 | 5141345716 |
10 | 2000020101 |
11 | 936a60782 |
12 | 479977059 |
13 | 25b483561 |
14 | 14d8a2429 |
15 | ba8b8836 |
hex | 7735e285 |
2000020101 has 8 divisors (see below), whose sum is σ = 2667979584. Its totient is φ = 1332703680.
The previous prime is 2000020081. The next prime is 2000020103. The reversal of 2000020101 is 1010200002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2000020101 - 26 = 2000020037 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2000020101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000020103) 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 7 ways as a sum of consecutive naturals, for example, 153460 + ... + 165981.
It is an arithmetic number, because the mean of its divisors is an integer number (333497448).
Almost surely, 22000020101 is an apocalyptic number.
It is an amenable number.
2000020101 is a deficient number, since it is larger than the sum of its proper divisors (667959483).
2000020101 is a wasteful number, since it uses less digits than its factorization.
2000020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321531.
The product of its (nonzero) digits is 4, while the sum is 6.
The square root of 2000020101 is about 44721.5842854432. The cubic root of 2000020101 is about 1259.9252708262.
Adding to 2000020101 its reverse (1010200002), we get a palindrome (3010220103).
The spelling of 2000020101 in words is "two billion, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •