Base | Representation |
---|---|
bin | 10100101100000010… |
… | …01000111110100000 |
3 | 1001200001102201010000 |
4 | 22112001020332200 |
5 | 140221321102104 |
6 | 5034041340000 |
7 | 542144243322 |
oct | 122601107640 |
9 | 31601381100 |
10 | 11106815904 |
11 | 478a5651a8 |
12 | 219b797600 |
13 | 10800b6622 |
14 | 775157612 |
15 | 45013d639 |
hex | 296048fa0 |
11106815904 has 480 divisors, whose sum is σ = 36672362496. Its totient is φ = 3281264640.
The previous prime is 11106815843. The next prime is 11106815911. The reversal of 11106815904 is 40951860111.
It is a happy number.
11106815904 is a `hidden beast` number, since 1 + 1 + 1 + 0 + 68 + 1 + 590 + 4 = 666.
It is a super-2 number, since 2×111068159042 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 64201162 + ... + 64201334.
Almost surely, 211106815904 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 11106815904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18336181248).
11106815904 is an abundant number, since it is smaller than the sum of its proper divisors (25565546592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11106815904 is a wasteful number, since it uses less digits than its factorization.
11106815904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290 (or 273 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 36.
The spelling of 11106815904 in words is "eleven billion, one hundred six million, eight hundred fifteen thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •