Base | Representation |
---|---|
bin | 10100101100011101… |
… | …11001101001010000 |
3 | 1001200022012222021121 |
4 | 22112032321221100 |
5 | 140223232014440 |
6 | 5034250532024 |
7 | 542220016066 |
oct | 122616715120 |
9 | 31608188247 |
10 | 11110423120 |
11 | 47915a9375 |
12 | 21a0a37014 |
13 | 1080a7a484 |
14 | 775816036 |
15 | 45060234a |
hex | 2963b9a50 |
11110423120 has 40 divisors (see below), whose sum is σ = 25837469064. Its totient is φ = 4443182592.
The previous prime is 11110423069. The next prime is 11110423193. The reversal of 11110423120 is 2132401111.
It can be written as a sum of positive squares in 4 ways, for example, as 3649609744 + 7460813376 = 60412^2 + 86376^2 .
It is a tau number, because it is divible by the number of its divisors (40).
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 = 11110423094 and 11110423103.
It is a congruent number.
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, 425482 + ... + 450838.
Almost surely, 211110423120 is an apocalyptic number.
11110423120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11110423120 is an abundant number, since it is smaller than the sum of its proper divisors (14727045944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110423120 is a wasteful number, since it uses less digits than its factorization.
11110423120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30847 (or 30841 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11110423120 its reverse (2132401111), we get a palindrome (13242824231).
The spelling of 11110423120 in words is "eleven billion, one hundred ten million, four hundred twenty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •