Base | Representation |
---|---|
bin | 10100101110000101… |
… | …11001110110101110 |
3 | 1001201020212120100110 |
4 | 22113002321312232 |
5 | 140240224233340 |
6 | 5035455040450 |
7 | 542443624413 |
oct | 122702716656 |
9 | 31636776313 |
10 | 11124055470 |
11 | 479926a580 |
12 | 21a5510126 |
13 | 1083841458 |
14 | 77756410a |
15 | 4518e6680 |
hex | 2970b9dae |
11124055470 has 64 divisors (see below), whose sum is σ = 29285867520. Its totient is φ = 2681827200.
The previous prime is 11124055421. The next prime is 11124055477. The reversal of 11124055470 is 7455042111.
It is a super-2 number, since 2×111240554702 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11124055477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33390 + ... + 152849.
It is an arithmetic number, because the mean of its divisors is an integer number (457591680).
Almost surely, 211124055470 is an apocalyptic number.
11124055470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11124055470 is an abundant number, since it is smaller than the sum of its proper divisors (18161812050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11124055470 is a wasteful number, since it uses less digits than its factorization.
11124055470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186441.
The product of its (nonzero) digits is 5600, while the sum is 30.
Adding to 11124055470 its reverse (7455042111), we get a palindrome (18579097581).
The spelling of 11124055470 in words is "eleven billion, one hundred twenty-four million, fifty-five thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •