Base | Representation |
---|---|
bin | 100010101000… |
… | …0100100100000 |
3 | 1021011102002100 |
4 | 1011100210200 |
5 | 14121441213 |
6 | 1445050400 |
7 | 310215246 |
oct | 105204440 |
9 | 37142070 |
10 | 18155808 |
11 | a280800 |
12 | 60b6a00 |
13 | 39b8ba8 |
14 | 25a8796 |
15 | 18d9773 |
hex | 1150920 |
18155808 has 108 divisors (see below), whose sum is σ = 56859894. Its totient is φ = 5491200.
The previous prime is 18155783. The next prime is 18155843. The reversal of 18155808 is 80855181.
It can be written as a sum of positive squares in only one way, i.e., 16744464 + 1411344 = 4092^2 + 1188^2 .
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 (7) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 34588 + ... + 35108.
Almost surely, 218155808 is an apocalyptic number.
18155808 is a gapful number since it is divisible by the number (18) 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 18155808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28429947).
18155808 is an abundant number, since it is smaller than the sum of its proper divisors (38704086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18155808 is a wasteful number, since it uses less digits than its factorization.
18155808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 559 (or 537 counting only the distinct ones).
The product of its (nonzero) digits is 12800, while the sum is 36.
The square root of 18155808 is about 4260.9632713742. The cubic root of 18155808 is about 262.8281392970.
The spelling of 18155808 in words is "eighteen million, one hundred fifty-five thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •