Base | Representation |
---|---|
bin | 10100100001001101… |
… | …10110000011010000 |
3 | 1001102201121122021002 |
4 | 22100212312003100 |
5 | 140030101132220 |
6 | 5021035521132 |
7 | 536662523444 |
oct | 122046660320 |
9 | 31381548232 |
10 | 11016036560 |
11 | 47432a1351 |
12 | 21752b91a8 |
13 | 1067350a39 |
14 | 767086824 |
15 | 4471aac75 |
hex | 2909b60d0 |
11016036560 has 40 divisors (see below), whose sum is σ = 25620003816. Its totient is φ = 4405086720.
The previous prime is 11016036557. The next prime is 11016036587. The reversal of 11016036560 is 6563061011.
It can be written as a sum of positive squares in 4 ways, for example, as 1134881344 + 9881155216 = 33688^2 + 99404^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×110160365602 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 272030 + ... + 309890.
Almost surely, 211016036560 is an apocalyptic number.
11016036560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11016036560 is an abundant number, since it is smaller than the sum of its proper divisors (14603967256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11016036560 is a wasteful number, since it uses less digits than its factorization.
11016036560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41511 (or 41505 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 29.
Adding to 11016036560 its reverse (6563061011), we get a palindrome (17579097571).
The spelling of 11016036560 in words is "eleven billion, sixteen million, thirty-six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •