Base | Representation |
---|---|
bin | 10101100010111010… |
… | …00001111110110100 |
3 | 1002212010120011210212 |
4 | 22301131001332310 |
5 | 142142140041431 |
6 | 5151443204552 |
7 | 556433554640 |
oct | 126135017664 |
9 | 32763504725 |
10 | 11567112116 |
11 | 49a637359a |
12 | 22a9976758 |
13 | 1124579951 |
14 | 7ba335c20 |
15 | 47a76272b |
hex | 2b1741fb4 |
11567112116 has 12 divisors (see below), whose sum is σ = 23134224288. Its totient is φ = 4957333752.
The previous prime is 11567112113. The next prime is 11567112131. The reversal of 11567112116 is 61121176511.
11567112116 is an admirable number.
It is a super-2 number, since 2×115671121162 (a number of 21 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (32) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11567112113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 206555546 + ... + 206555601.
It is an arithmetic number, because the mean of its divisors is an integer number (1927852024).
Almost surely, 211567112116 is an apocalyptic number.
It is an amenable number.
11567112116 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11567112116 is a wasteful number, since it uses less digits than its factorization.
11567112116 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 413111158 (or 413111156 counting only the distinct ones).
The product of its digits is 2520, while the sum is 32.
Adding to 11567112116 its reverse (61121176511), we get a palindrome (72688288627).
The spelling of 11567112116 in words is "eleven billion, five hundred sixty-seven million, one hundred twelve thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •