Base | Representation |
---|---|
bin | 10100100001101100… |
… | …11001000011101111 |
3 | 1001110000021200212102 |
4 | 22100312121003233 |
5 | 140032122041421 |
6 | 5021303125315 |
7 | 540042256511 |
oct | 122066310357 |
9 | 31400250772 |
10 | 11020112111 |
11 | 4745625378 |
12 | 217674383b |
13 | 1068149ac8 |
14 | 767827bb1 |
15 | 44771360b |
hex | 290d990ef |
11020112111 has 12 divisors (see below), whose sum is σ = 11297802600. Its totient is φ = 10749095280.
The previous prime is 11020112101. The next prime is 11020112123. The reversal of 11020112111 is 11121102011.
11020112111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11020112111 - 210 = 11020111087 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11020112092 and 11020112101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020112101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1495865 + ... + 1503213.
It is an arithmetic number, because the mean of its divisors is an integer number (941483550).
Almost surely, 211020112111 is an apocalyptic number.
11020112111 is a deficient number, since it is larger than the sum of its proper divisors (277690489).
11020112111 is an frugal number, since it uses more digits than its factorization.
11020112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8246 (or 8203 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11020112111 its reverse (11121102011), we get a palindrome (22141214122).
The spelling of 11020112111 in words is "eleven billion, twenty million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •