Base | Representation |
---|---|
bin | 111011101010101… |
… | …1010011100000101 |
3 | 12011112022022122201 |
4 | 1313111122130011 |
5 | 13100014231041 |
6 | 530355554501 |
7 | 100420405063 |
oct | 16725323405 |
9 | 5145268581 |
10 | 2002102021 |
11 | 938152977 |
12 | 47a5bba31 |
13 | 25ba3206a |
14 | 14dc85033 |
15 | bab7a631 |
hex | 7755a705 |
2002102021 has 8 divisors (see below), whose sum is σ = 2022681024. Its totient is φ = 1981573440.
The previous prime is 2002102009. The next prime is 2002102043. The reversal of 2002102021 is 1202012002.
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 2002102021 - 215 = 2002069253 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002101989 and 2002102007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002132021) 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, 69966 + ... + 94336.
It is an arithmetic number, because the mean of its divisors is an integer number (252835128).
Almost surely, 22002102021 is an apocalyptic number.
It is an amenable number.
2002102021 is a deficient number, since it is larger than the sum of its proper divisors (20579003).
2002102021 is a wasteful number, since it uses less digits than its factorization.
2002102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25211.
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 2002102021 is about 44744.8546874386. The cubic root of 2002102021 is about 1260.3622920984.
Adding to 2002102021 its reverse (1202012002), we get a palindrome (3204114023).
The spelling of 2002102021 in words is "two billion, two million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •