Base | Representation |
---|---|
bin | 10100101101111110… |
… | …10011110010100000 |
3 | 1001201012002200200121 |
4 | 22112333103302200 |
5 | 140240004104440 |
6 | 5035422530024 |
7 | 542432621140 |
oct | 122677236240 |
9 | 31635080617 |
10 | 11123113120 |
11 | 4798786579 |
12 | 21a5136914 |
13 | 10835a1552 |
14 | 77739a920 |
15 | 4517ac34a |
hex | 296fd3ca0 |
11123113120 has 48 divisors (see below), whose sum is σ = 30032408448. Its totient is φ = 3813638400.
The previous prime is 11123113109. The next prime is 11123113153. The reversal of 11123113120 is 2131132111.
It is a happy number.
It is a super-2 number, since 2×111231131202 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 11123113094 and 11123113103.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4964556 + ... + 4966795.
It is an arithmetic number, because the mean of its divisors is an integer number (625675176).
Almost surely, 211123113120 is an apocalyptic number.
11123113120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11123113120 is an abundant number, since it is smaller than the sum of its proper divisors (18909295328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11123113120 is an equidigital number, since it uses as much as digits as its factorization.
11123113120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9931373 (or 9931365 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11123113120 its reverse (2131132111), we get a palindrome (13254245231).
The spelling of 11123113120 in words is "eleven billion, one hundred twenty-three million, one hundred thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •