Base | Representation |
---|---|
bin | 10010101001011010… |
… | …11001000111101111 |
3 | 221211200200121001100 |
4 | 21110231121013233 |
5 | 131000321320421 |
6 | 4333221014143 |
7 | 503041055046 |
oct | 112455310757 |
9 | 27750617040 |
10 | 10011120111 |
11 | 427801a793 |
12 | 1b34854353 |
13 | c370b1b15 |
14 | 6ad81955d |
15 | 3d8d57c26 |
hex | 254b591ef |
10011120111 has 6 divisors (see below), whose sum is σ = 14460506840. Its totient is φ = 6674080068.
The previous prime is 10011120107. The next prime is 10011120113. The reversal of 10011120111 is 11102111001.
It is not a de Polignac number, because 10011120111 - 22 = 10011120107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1112346679 = 10011120111 / (1 + 0 + 0 + 1 + 1 + 1 + 2 + 0 + 1 + 1 + 1).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10011120093 and 10011120102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011120113) 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 5 ways as a sum of consecutive naturals, for example, 556173331 + ... + 556173348.
Almost surely, 210011120111 is an apocalyptic number.
10011120111 is a deficient number, since it is larger than the sum of its proper divisors (4449386729).
10011120111 is a wasteful number, since it uses less digits than its factorization.
10011120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112346685 (or 1112346682 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10011120111 its reverse (11102111001), we get a palindrome (21113231112).
The spelling of 10011120111 in words is "ten billion, eleven million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •