Base | Representation |
---|---|
bin | 111011101010100… |
… | …0010000010110101 |
3 | 12011112010020120222 |
4 | 1313111002002311 |
5 | 13100003031401 |
6 | 530353504125 |
7 | 100416510551 |
oct | 16725020265 |
9 | 5145106528 |
10 | 2002002101 |
11 | 9380948a0 |
12 | 47a572045 |
13 | 25b9c8738 |
14 | 14dc5a861 |
15 | bab5ac1b |
hex | 775420b5 |
2002002101 has 8 divisors (see below), whose sum is σ = 2221020000. Its totient is φ = 1789153840.
The previous prime is 2002002077. The next prime is 2002002157. The reversal of 2002002101 is 1012002002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2002002101 - 214 = 2001985717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002002001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1541726 + ... + 1543023.
It is an arithmetic number, because the mean of its divisors is an integer number (277627500).
Almost surely, 22002002101 is an apocalyptic number.
It is an amenable number.
2002002101 is a deficient number, since it is larger than the sum of its proper divisors (219017899).
2002002101 is a wasteful number, since it uses less digits than its factorization.
2002002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3084819.
The product of its (nonzero) digits is 8, while the sum is 8.
The square root of 2002002101 is about 44743.7381205460. The cubic root of 2002002101 is about 1260.3413245530.
Adding to 2002002101 its reverse (1012002002), we get a palindrome (3014004103).
Subtracting from 2002002101 its reverse (1012002002), we obtain a palindrome (990000099).
It can be divided in two parts, 2002002 and 101, that multiplied together give a palindrome (202202202).
The spelling of 2002002101 in words is "two billion, two million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •