Base | Representation |
---|---|
bin | 10100101100010110… |
… | …10110000110100111 |
3 | 1001200020110121210202 |
4 | 22112023112012213 |
5 | 140223012203421 |
6 | 5034214541115 |
7 | 542206054625 |
oct | 122613260647 |
9 | 31606417722 |
10 | 11109491111 |
11 | 4791022114 |
12 | 21a066779b |
13 | 10808121a4 |
14 | 775652515 |
15 | 4504bb10b |
hex | 2962d61a7 |
11109491111 has 16 divisors (see below), whose sum is σ = 11596535808. Its totient is φ = 10630807200.
The previous prime is 11109491059. The next prime is 11109491123. The reversal of 11109491111 is 11119490111.
11109491111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11109491111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11109491011) 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 15 ways as a sum of consecutive naturals, for example, 2510681 + ... + 2515101.
It is an arithmetic number, because the mean of its divisors is an integer number (724783488).
Almost surely, 211109491111 is an apocalyptic number.
11109491111 is a deficient number, since it is larger than the sum of its proper divisors (487044697).
11109491111 is a wasteful number, since it uses less digits than its factorization.
11109491111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5342.
The product of its (nonzero) digits is 324, while the sum is 29.
The spelling of 11109491111 in words is "eleven billion, one hundred nine million, four hundred ninety-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •