Base | Representation |
---|---|
bin | 10100101101101001… |
… | …01101100011000000 |
3 | 1001200222212112212202 |
4 | 22112310231203000 |
5 | 140233301210130 |
6 | 5035243212332 |
7 | 542400200603 |
oct | 122664554300 |
9 | 31628775782 |
10 | 11120335040 |
11 | 4797159341 |
12 | 21a42170a8 |
13 | 1082b3ac09 |
14 | 776c7633a |
15 | 45140e145 |
hex | 296d2d8c0 |
11120335040 has 56 divisors (see below), whose sum is σ = 26520983280. Its totient is φ = 4441299968.
The previous prime is 11120335033. The next prime is 11120335043. The reversal of 11120335040 is 4053302111.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (11120335043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 184514 + ... + 237246.
Almost surely, 211120335040 is an apocalyptic number.
11120335040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11120335040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13260491640).
11120335040 is an abundant number, since it is smaller than the sum of its proper divisors (15400648240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120335040 is an equidigital number, since it uses as much as digits as its factorization.
11120335040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53409 (or 53399 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 11120335040 its reverse (4053302111), we get a palindrome (15173637151).
The spelling of 11120335040 in words is "eleven billion, one hundred twenty million, three hundred thirty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •