Base | Representation |
---|---|
bin | 111011101010101… |
… | …1101011010100011 |
3 | 12011112022221101012 |
4 | 1313111131122203 |
5 | 13100020123321 |
6 | 530400131135 |
7 | 100420455446 |
oct | 16725353243 |
9 | 5145287335 |
10 | 2002114211 |
11 | 938161049 |
12 | 47a606aab |
13 | 25ba37786 |
14 | 14dc8965d |
15 | bab7e05b |
hex | 7755d6a3 |
2002114211 has 4 divisors (see below), whose sum is σ = 2004627072. Its totient is φ = 1999601352.
The previous prime is 2002114207. The next prime is 2002114217. The reversal of 2002114211 is 1124112002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2002114211 - 22 = 2002114207 is a prime.
It is a super-2 number, since 2×20021142112 = 8016922627776305042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002114217) 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 3 ways as a sum of consecutive naturals, for example, 1255235 + ... + 1256828.
It is an arithmetic number, because the mean of its divisors is an integer number (501156768).
Almost surely, 22002114211 is an apocalyptic number.
2002114211 is a deficient number, since it is larger than the sum of its proper divisors (2512861).
2002114211 is an equidigital number, since it uses as much as digits as its factorization.
2002114211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2512860.
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 2002114211 is about 44744.9909040107. The cubic root of 2002114211 is about 1260.3648500409.
Adding to 2002114211 its reverse (1124112002), we get a palindrome (3126226213).
The spelling of 2002114211 in words is "two billion, two million, one hundred fourteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •