Base | Representation |
---|---|
bin | 11001010000111000001011… |
… | …101011111010110100011011 |
3 | 112120102002220122001221211000 |
4 | 121100320023223322310123 |
5 | 104030420312000310021 |
6 | 1032151404433440043 |
7 | 32255335106011251 |
oct | 3120701353726433 |
9 | 476362818057730 |
10 | 111111000010011 |
11 | 32448a01936551 |
12 | 10566081110023 |
13 | 49cc950ca87a1 |
14 | 1d61b302bc5d1 |
15 | cca3bac55b26 |
hex | 650e0bafad1b |
111111000010011 has 8 divisors (see below), whose sum is σ = 164608888903760. Its totient is φ = 74074000006656.
The previous prime is 111111000010001. The next prime is 111111000010051. The reversal of 111111000010011 is 110010000111111.
It is not a de Polignac number, because 111111000010011 - 217 = 111110999878939 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111111000009975 and 111111000010002.
It is not an unprimeable number, because it can be changed into a prime (111111000010001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2057611111270 + ... + 2057611111323.
It is an arithmetic number, because the mean of its divisors is an integer number (20576111112970).
Almost surely, 2111111000010011 is an apocalyptic number.
111111000010011 is a deficient number, since it is larger than the sum of its proper divisors (53497888893749).
111111000010011 is an equidigital number, since it uses as much as digits as its factorization.
111111000010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4115222222602 (or 4115222222596 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 111111000010011 its reverse (110010000111111), we get a palindrome (221121000121122).
The spelling of 111111000010011 in words is "one hundred eleven trillion, one hundred eleven billion, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •