Base | Representation |
---|---|
bin | 111011101000110… |
… | …1011101100001111 |
3 | 12011110110122012211 |
4 | 1313101223230033 |
5 | 13044241432421 |
6 | 530323011251 |
7 | 100406163040 |
oct | 16721535417 |
9 | 5143418184 |
10 | 2001124111 |
11 | 937645188 |
12 | 47a209b27 |
13 | 25b77bc0c |
14 | 14daac8c7 |
15 | baa359e1 |
hex | 7746bb0f |
2001124111 has 8 divisors (see below), whose sum is σ = 2421528480. Its totient is φ = 1614352128.
The previous prime is 2001124109. The next prime is 2001124117. The reversal of 2001124111 is 1114211002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2001124111 - 21 = 2001124109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2001124091 and 2001124100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001124117) 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, 8407966 + ... + 8408203.
It is an arithmetic number, because the mean of its divisors is an integer number (302691060).
Almost surely, 22001124111 is an apocalyptic number.
2001124111 is a deficient number, since it is larger than the sum of its proper divisors (420404369).
2001124111 is a wasteful number, since it uses less digits than its factorization.
2001124111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16816193.
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 2001124111 is about 44733.9257275728. The cubic root of 2001124111 is about 1260.1570542031.
Adding to 2001124111 its reverse (1114211002), we get a palindrome (3115335113).
The spelling of 2001124111 in words is "two billion, one million, one hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •