Base | Representation |
---|---|
bin | 101010010111… |
… | …001011001000 |
3 | 202220012011010 |
4 | 222113023020 |
5 | 10320324333 |
6 | 1034003520 |
7 | 163251000 |
oct | 52271310 |
9 | 22805133 |
10 | 11104968 |
11 | 62a5366 |
12 | 38765a0 |
13 | 23ba7b4 |
14 | 1691000 |
15 | e95563 |
hex | a972c8 |
11104968 has 128 divisors (see below), whose sum is σ = 34560000. Its totient is φ = 2963520.
The previous prime is 11104967. The next prime is 11104991. The reversal of 11104968 is 86940111.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (11104963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 156373 + ... + 156443.
It is an arithmetic number, because the mean of its divisors is an integer number (270000).
Almost surely, 211104968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11104968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17280000).
11104968 is an abundant number, since it is smaller than the sum of its proper divisors (23455032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11104968 is a wasteful number, since it uses less digits than its factorization.
11104968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 30.
The square root of 11104968 is about 3332.4117392663. The cubic root of 11104968 is about 223.1031851029.
The spelling of 11104968 in words is "eleven million, one hundred four thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •