Base | Representation |
---|---|
bin | 1100111010111… |
… | …10000111111100 |
3 | 21112221201120020 |
4 | 12131132013330 |
5 | 210221420420 |
6 | 14431052140 |
7 | 2454201336 |
oct | 635360774 |
9 | 245851506 |
10 | 108388860 |
11 | 56201178 |
12 | 30371050 |
13 | 195bcc28 |
14 | 10576456 |
15 | 97b0340 |
hex | 675e1fc |
108388860 has 48 divisors (see below), whose sum is σ = 306343296. Its totient is φ = 28631872.
The previous prime is 108388859. The next prime is 108388877. The reversal of 108388860 is 68883801.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2022 + ... + 14861.
It is an arithmetic number, because the mean of its divisors is an integer number (6382152).
Almost surely, 2108388860 is an apocalyptic number.
108388860 is a gapful number since it is divisible by the number (10) 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 108388860, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153171648).
108388860 is an abundant number, since it is smaller than the sum of its proper divisors (197954436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108388860 is a wasteful number, since it uses less digits than its factorization.
108388860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17002 (or 17000 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 42.
The square root of 108388860 is about 10410.9970704059. The cubic root of 108388860 is about 476.7911835581.
The spelling of 108388860 in words is "one hundred eight million, three hundred eighty-eight thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •