Base | Representation |
---|---|
bin | 111011101010100… |
… | …0100011111001111 |
3 | 12011112010202022201 |
4 | 1313111010133033 |
5 | 13100003341421 |
6 | 530354022331 |
7 | 100416552001 |
oct | 16725043717 |
9 | 5145122281 |
10 | 2002012111 |
11 | 9380a1370 |
12 | 47a5779a7 |
13 | 25ba00168 |
14 | 14dc60371 |
15 | bab5db91 |
hex | 775447cf |
2002012111 has 8 divisors (see below), whose sum is σ = 2185375104. Its totient is φ = 1818876120.
The previous prime is 2002012093. The next prime is 2002012151. The reversal of 2002012111 is 1112102002.
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-2002012111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002012151) 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 7 ways as a sum of consecutive naturals, for example, 38035 + ... + 73828.
It is an arithmetic number, because the mean of its divisors is an integer number (273171888).
Almost surely, 22002012111 is an apocalyptic number.
2002012111 is a deficient number, since it is larger than the sum of its proper divisors (183362993).
2002012111 is a wasteful number, since it uses less digits than its factorization.
2002012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113501.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 2002012111 is about 44743.8499796341. The cubic root of 2002012111 is about 1260.3434251162.
Adding to 2002012111 its reverse (1112102002), we get a palindrome (3114114113).
It can be divided in two parts, 20020 and 12111, that added together give a triangular number (32131 = T253).
The spelling of 2002012111 in words is "two billion, two million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •