Base | Representation |
---|---|
bin | 100000111000000… |
… | …1101011001001000 |
3 | 2211212210011122120 |
4 | 1001300031121020 |
5 | 4224402004213 |
6 | 301244251240 |
7 | 36223451415 |
oct | 10160153110 |
9 | 2755704576 |
10 | 1103156808 |
11 | 516781046 |
12 | 269540b20 |
13 | 147717810 |
14 | a672110c |
15 | 66cab423 |
hex | 41c0d648 |
1103156808 has 64 divisors (see below), whose sum is σ = 2979849600. Its totient is φ = 338311680.
The previous prime is 1103156771. The next prime is 1103156819. The reversal of 1103156808 is 8086513011.
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, 91348 + ... + 102716.
It is an arithmetic number, because the mean of its divisors is an integer number (46560150).
Almost surely, 21103156808 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 1103156808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1489924800).
1103156808 is an abundant number, since it is smaller than the sum of its proper divisors (1876692792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103156808 is a wasteful number, since it uses less digits than its factorization.
1103156808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11702 (or 11698 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 33.
The square root of 1103156808 is about 33213.8044794631. The cubic root of 1103156808 is about 1033.2666602374.
Adding to 1103156808 its reverse (8086513011), we get a palindrome (9189669819).
The spelling of 1103156808 in words is "one billion, one hundred three million, one hundred fifty-six thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •