Base | Representation |
---|---|
bin | 101010011011… |
… | …110110011110 |
3 | 202221011102200 |
4 | 222123312132 |
5 | 10321433001 |
6 | 1034232330 |
7 | 163360566 |
oct | 52336636 |
9 | 22834380 |
10 | 11124126 |
11 | 63087a2 |
12 | 38856a6 |
13 | 23c6430 |
14 | 1697da6 |
15 | e9b086 |
hex | a9bd9e |
11124126 has 48 divisors (see below), whose sum is σ = 26221104. Its totient is φ = 3388032.
The previous prime is 11124121. The next prime is 11124151. The reversal of 11124126 is 62142111.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11124099 and 11124108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11124121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31885 + ... + 32231.
It is an arithmetic number, because the mean of its divisors is an integer number (546273).
Almost surely, 211124126 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11124126, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13110552).
11124126 is an abundant number, since it is smaller than the sum of its proper divisors (15096978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11124126 is a wasteful number, since it uses less digits than its factorization.
11124126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505 (or 502 counting only the distinct ones).
The product of its digits is 96, while the sum is 18.
The square root of 11124126 is about 3335.2849953190. The cubic root of 11124126 is about 223.2314086528.
Adding to 11124126 its reverse (62142111), we get a palindrome (73266237).
The spelling of 11124126 in words is "eleven million, one hundred twenty-four thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •