Base | Representation |
---|---|
bin | 1100111010111… |
… | …10010011000000 |
3 | 21112221202112110 |
4 | 12131132103000 |
5 | 210221431233 |
6 | 14431055320 |
7 | 2454203400 |
oct | 635362300 |
9 | 245852473 |
10 | 108389568 |
11 | 56201761 |
12 | 30371540 |
13 | 195c0351 |
14 | 10576800 |
15 | 97b0663 |
hex | 675e4c0 |
108389568 has 168 divisors, whose sum is σ = 342954864. Its totient is φ = 30105600.
The previous prime is 108389543. The next prime is 108389573. The reversal of 108389568 is 865983801.
It is a tau number, because it is divible by the number of its divisors (168).
It is a Harshad number since it is a multiple of its sum of digits (48).
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 23 ways as a sum of consecutive naturals, for example, 385588 + ... + 385868.
It is an arithmetic number, because the mean of its divisors is an integer number (2041398).
Almost surely, 2108389568 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 108389568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171477432).
108389568 is an abundant number, since it is smaller than the sum of its proper divisors (234565296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108389568 is a wasteful number, since it uses less digits than its factorization.
108389568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351 (or 334 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 48.
The square root of 108389568 is about 10411.0310728573. The cubic root of 108389568 is about 476.7922216949.
The spelling of 108389568 in words is "one hundred eight million, three hundred eighty-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •