Base | Representation |
---|---|
bin | 10100101011100000… |
… | …10001001001000000 |
3 | 1001122202002222212220 |
4 | 22111300101021000 |
5 | 140214203033041 |
6 | 5033402451040 |
7 | 542061532260 |
oct | 122560211100 |
9 | 31582088786 |
10 | 11102392896 |
11 | 4788014121 |
12 | 219a203a80 |
13 | 107c1c836a |
14 | 7747257a0 |
15 | 44ea67d66 |
hex | 295c11240 |
11102392896 has 112 divisors (see below), whose sum is σ = 33797443200. Its totient is φ = 3150766080.
The previous prime is 11102392879. The next prime is 11102392907. The reversal of 11102392896 is 69829320111.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 172536 + ... + 227976.
Almost surely, 211102392896 is an apocalyptic number.
11102392896 is a gapful number since it is divisible by the number (16) 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 11102392896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16898721600).
11102392896 is an abundant number, since it is smaller than the sum of its proper divisors (22695050304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102392896 is a wasteful number, since it uses less digits than its factorization.
11102392896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55612 (or 55602 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 42.
The spelling of 11102392896 in words is "eleven billion, one hundred two million, three hundred ninety-two thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •