Base | Representation |
---|---|
bin | 111011101010101… |
… | …1111010100100101 |
3 | 12011112100100002110 |
4 | 1313111133110211 |
5 | 13100020401041 |
6 | 530400231233 |
7 | 100420520304 |
oct | 16725372445 |
9 | 5145310073 |
10 | 2002122021 |
11 | 9381669a9 |
12 | 47a60b519 |
13 | 25ba3b1b3 |
14 | 14dc8c43b |
15 | bab81516 |
hex | 7755f525 |
2002122021 has 8 divisors (see below), whose sum is σ = 2674239840. Its totient is φ = 1332376112.
The previous prime is 2002122019. The next prime is 2002122037. The reversal of 2002122021 is 1202212002.
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 2002122021 - 21 = 2002122019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002121988 and 2002122006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002122041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 591006 + ... + 594383.
It is an arithmetic number, because the mean of its divisors is an integer number (334279980).
Almost surely, 22002122021 is an apocalyptic number.
It is an amenable number.
2002122021 is a deficient number, since it is larger than the sum of its proper divisors (672117819).
2002122021 is a wasteful number, since it uses less digits than its factorization.
2002122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1185955.
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 2002122021 is about 44745.0781762643. The cubic root of 2002122021 is about 1260.3664888812.
Adding to 2002122021 its reverse (1202212002), we get a palindrome (3204334023).
The spelling of 2002122021 in words is "two billion, two million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •