Base | Representation |
---|---|
bin | 11101001000100110011… |
… | …101110010001101111011 |
3 | 21002101202210120002100001 |
4 | 131020212131302031323 |
5 | 230300300111231021 |
6 | 4131430241253431 |
7 | 264434623035322 |
oct | 35104635621573 |
9 | 7071683502301 |
10 | 2002100102011 |
11 | 7020a4349589 |
12 | 28402b334277 |
13 | 116a49689799 |
14 | 6cc8b7650b9 |
15 | 3712c565091 |
hex | 1d22677237b |
2002100102011 has 4 divisors (see below), whose sum is σ = 2002549309992. Its totient is φ = 2001650894032.
The previous prime is 2002100101957. The next prime is 2002100102033. The reversal of 2002100102011 is 1102010012002.
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 2002100102011 - 29 = 2002100101499 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002100102071) 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 3 ways as a sum of consecutive naturals, for example, 224597305 + ... + 224606218.
It is an arithmetic number, because the mean of its divisors is an integer number (500637327498).
Almost surely, 22002100102011 is an apocalyptic number.
2002100102011 is a deficient number, since it is larger than the sum of its proper divisors (449207981).
2002100102011 is an equidigital number, since it uses as much as digits as its factorization.
2002100102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 449207980.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2002100102011 its reverse (1102010012002), we get a palindrome (3104110114013).
Subtracting from 2002100102011 its reverse (1102010012002), we obtain a palindrome (900090090009).
The spelling of 2002100102011 in words is "two trillion, two billion, one hundred million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •