Base | Representation |
---|---|
bin | 11101001000100111001… |
… | …011100011011010101011 |
3 | 21002101210122010122111102 |
4 | 131020213023203122223 |
5 | 230300311144200021 |
6 | 4131431350352015 |
7 | 264435130026032 |
oct | 35104713433253 |
9 | 7071718118442 |
10 | 2002112100011 |
11 | 7021000a3891 |
12 | 28403335b60b |
13 | 116a4bcca8aa |
14 | 6cc8d1a9719 |
15 | 3712d63500b |
hex | 1d2272e36ab |
2002112100011 has 4 divisors (see below), whose sum is σ = 2003643939192. Its totient is φ = 2000580260832.
The previous prime is 2002112099927. The next prime is 2002112100013. The reversal of 2002112100011 is 1100012112002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002112100011 is a prime.
It is a super-2 number, since 2×20021121000112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002112099965 and 2002112100001.
It is not an unprimeable number, because it can be changed into a prime (2002112100013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 765917630 + ... + 765920243.
It is an arithmetic number, because the mean of its divisors is an integer number (500910984798).
Almost surely, 22002112100011 is an apocalyptic number.
2002112100011 is a deficient number, since it is larger than the sum of its proper divisors (1531839181).
2002112100011 is a wasteful number, since it uses less digits than its factorization.
2002112100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1531839180.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2002112100011 its reverse (1100012112002), we get a palindrome (3102124212013).
The spelling of 2002112100011 in words is "two trillion, two billion, one hundred twelve million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •