Base | Representation |
---|---|
bin | 10100011111110010… |
… | …00110110010111000 |
3 | 1001101220001111000112 |
4 | 22033321012302320 |
5 | 140014013442040 |
6 | 5015530523452 |
7 | 536455565165 |
oct | 121771066270 |
9 | 31356044015 |
10 | 11004046520 |
11 | 4737552025 |
12 | 2171296588 |
13 | 1064a1343c |
14 | 76564506c |
15 | 4460dd365 |
hex | 28fe46cb8 |
11004046520 has 64 divisors (see below), whose sum is σ = 25646004000. Its totient is φ = 4244341248.
The previous prime is 11004046483. The next prime is 11004046523. The reversal of 11004046520 is 2564040011.
It is a super-2 number, since 2×110040465202 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11004046523) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 955919 + ... + 967361.
Almost surely, 211004046520 is an apocalyptic number.
11004046520 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 11004046520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12823002000).
11004046520 is an abundant number, since it is smaller than the sum of its proper divisors (14641957480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11004046520 is a wasteful number, since it uses less digits than its factorization.
11004046520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12312 (or 12308 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 11004046520 its reverse (2564040011), we get a palindrome (13568086531).
The spelling of 11004046520 in words is "eleven billion, four million, forty-six thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •