Base | Representation |
---|---|
bin | 10100101101100111… |
… | …10100011010010011 |
3 | 1001200222102122212000 |
4 | 22112303310122103 |
5 | 140233221213021 |
6 | 5035234205043 |
7 | 542365204365 |
oct | 122663643223 |
9 | 31628378760 |
10 | 11120101011 |
11 | 4797009528 |
12 | 21a4123783 |
13 | 1082a88536 |
14 | 776c14d35 |
15 | 4513b4b26 |
hex | 296cf4693 |
11120101011 has 64 divisors (see below), whose sum is σ = 17364326400. Its totient is φ = 7023542400.
The previous prime is 11120101009. The next prime is 11120101061. The reversal of 11120101011 is 11010102111.
It is not a de Polignac number, because 11120101011 - 21 = 11120101009 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 = 11120100984 and 11120101002.
It is not an unprimeable number, because it can be changed into a prime (11120101061) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 17622666 + ... + 17623296.
It is an arithmetic number, because the mean of its divisors is an integer number (271317600).
Almost surely, 211120101011 is an apocalyptic number.
11120101011 is a deficient number, since it is larger than the sum of its proper divisors (6244225389).
11120101011 is a wasteful number, since it uses less digits than its factorization.
11120101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1057 (or 1051 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11120101011 its reverse (11010102111), we get a palindrome (22130203122).
The spelling of 11120101011 in words is "eleven billion, one hundred twenty million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •