Base | Representation |
---|---|
bin | 10100101011001110… |
… | …01110000101110111 |
3 | 1001122120122111102000 |
4 | 22111213032011313 |
5 | 140213101133421 |
6 | 5033235550343 |
7 | 542032423404 |
oct | 122547160567 |
9 | 31576574360 |
10 | 11100021111 |
11 | 4786744173 |
12 | 219945b3b3 |
13 | 107b87793a |
14 | 7742a92ab |
15 | 44e74a226 |
hex | 2959ce177 |
11100021111 has 32 divisors (see below), whose sum is σ = 16533504000. Its totient is φ = 7360053984.
The previous prime is 11100021091. The next prime is 11100021137. The reversal of 11100021111 is 11112000111.
It is not a de Polignac number, because 11100021111 - 231 = 8952537463 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11100021093 and 11100021102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100021151) 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 31 ways as a sum of consecutive naturals, for example, 6673866 + ... + 6675528.
It is an arithmetic number, because the mean of its divisors is an integer number (516672000).
Almost surely, 211100021111 is an apocalyptic number.
11100021111 is a deficient number, since it is larger than the sum of its proper divisors (5433482889).
11100021111 is a wasteful number, since it uses less digits than its factorization.
11100021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2860 (or 2854 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11100021111 its reverse (11112000111), we get a palindrome (22212021222).
The spelling of 11100021111 in words is "eleven billion, one hundred million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •