Base | Representation |
---|---|
bin | 101010010111… |
… | …000100000000 |
3 | 202220011112020 |
4 | 222113010000 |
5 | 10320321022 |
6 | 1034001440 |
7 | 163246446 |
oct | 52270400 |
9 | 22804466 |
10 | 11104512 |
11 | 62a4a91 |
12 | 3876280 |
13 | 23ba523 |
14 | 1690b96 |
15 | e9535c |
hex | a97100 |
11104512 has 72 divisors (see below), whose sum is σ = 31150560. Its totient is φ = 3502080.
The previous prime is 11104459. The next prime is 11104517. The reversal of 11104512 is 21540111.
It is a happy number.
It is a nialpdrome in base 16.
It is a junction number, because it is equal to n+sod(n) for n = 11104491 and 11104500.
It is not an unprimeable number, because it can be changed into a prime (11104517) 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, 14212 + ... + 14972.
Almost surely, 211104512 is an apocalyptic number.
11104512 is a gapful number since it is divisible by the number (12) 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 11104512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15575280).
11104512 is an abundant number, since it is smaller than the sum of its proper divisors (20046048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11104512 is an equidigital number, since it uses as much as digits as its factorization.
11104512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 799 (or 785 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 15.
The square root of 11104512 is about 3332.3433196476. The cubic root of 11104512 is about 223.1001313212.
Adding to 11104512 its reverse (21540111), we get a palindrome (32644623).
The spelling of 11104512 in words is "eleven million, one hundred four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •