Base | Representation |
---|---|
bin | 111011101010101… |
… | …1111000110010111 |
3 | 12011112100021211202 |
4 | 1313111133012113 |
5 | 13100020333421 |
6 | 530400223115 |
7 | 100420514534 |
oct | 16725370627 |
9 | 5145307752 |
10 | 2002121111 |
11 | 938166251 |
12 | 47a60aa9b |
13 | 25ba3a963 |
14 | 14dc8bd8b |
15 | bab8110b |
hex | 7755f197 |
2002121111 has 8 divisors (see below), whose sum is σ = 2086064400. Its totient is φ = 1919171520.
The previous prime is 2002121071. The next prime is 2002121129. The reversal of 2002121111 is 1111212002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002121111 is a prime.
It is a super-2 number, since 2×20021211112 = 8016977886223748642, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002121092 and 2002121101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002129111) 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, 244310 + ... + 252371.
It is an arithmetic number, because the mean of its divisors is an integer number (260758050).
Almost surely, 22002121111 is an apocalyptic number.
2002121111 is a deficient number, since it is larger than the sum of its proper divisors (83943289).
2002121111 is a wasteful number, since it uses less digits than its factorization.
2002121111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 496849.
The product of its (nonzero) digits is 8, while the sum is 11.
The square root of 2002121111 is about 44745.0680075469. The cubic root of 2002121111 is about 1260.3662979282.
Adding to 2002121111 its reverse (1111212002), we get a palindrome (3113333113).
The spelling of 2002121111 in words is "two billion, two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •