Base | Representation |
---|---|
bin | 111011101010101… |
… | …1111010111011111 |
3 | 12011112100100100100 |
4 | 1313111133113133 |
5 | 13100020402312 |
6 | 530400232143 |
7 | 100420520661 |
oct | 16725372737 |
9 | 5145310310 |
10 | 2002122207 |
11 | 938167058 |
12 | 47a60b653 |
13 | 25ba3b2c7 |
14 | 14dc8c531 |
15 | bab815dc |
hex | 7755f5df |
2002122207 has 48 divisors (see below), whose sum is σ = 3173772160. Its totient is φ = 1211702976.
The previous prime is 2002122203. The next prime is 2002122211. The reversal of 2002122207 is 7022212002.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2002122203) and next prime (2002122211).
It is not a de Polignac number, because 2002122207 - 22 = 2002122203 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2002122207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002122203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 421548 + ... + 426270.
Almost surely, 22002122207 is an apocalyptic number.
2002122207 is a deficient number, since it is larger than the sum of its proper divisors (1171649953).
2002122207 is a wasteful number, since it uses less digits than its factorization.
2002122207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4852 (or 4849 counting only the distinct ones).
The product of its (nonzero) digits is 224, while the sum is 18.
The square root of 2002122207 is about 44745.0802547051. The cubic root of 2002122207 is about 1260.3665279112.
Adding to 2002122207 its reverse (7022212002), we get a palindrome (9024334209).
The spelling of 2002122207 in words is "two billion, two million, one hundred twenty-two thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •