Base | Representation |
---|---|
bin | 1100111000100… |
… | …10011100001101 |
3 | 21112100222022210 |
4 | 12130102130031 |
5 | 210132010421 |
6 | 14420301033 |
7 | 2451440502 |
oct | 634223415 |
9 | 245328283 |
10 | 108078861 |
11 | 5600a280 |
12 | 30241779 |
13 | 19511ab7 |
14 | 104d54a9 |
15 | 974d576 |
hex | 671270d |
108078861 has 8 divisors (see below), whose sum is σ = 157205664. Its totient is φ = 65502320.
The previous prime is 108078851. The next prime is 108078871. The reversal of 108078861 is 168870801.
It is an interprime number because it is at equal distance from previous prime (108078851) and next prime (108078871).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 108078861 - 26 = 108078797 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108078811) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1637526 + ... + 1637591.
It is an arithmetic number, because the mean of its divisors is an integer number (19650708).
Almost surely, 2108078861 is an apocalyptic number.
108078861 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
108078861 is a deficient number, since it is larger than the sum of its proper divisors (49126803).
108078861 is a wasteful number, since it uses less digits than its factorization.
108078861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3275131.
The product of its (nonzero) digits is 21504, while the sum is 39.
The square root of 108078861 is about 10396.0983546713. The cubic root of 108078861 is about 476.3361985323.
The spelling of 108078861 in words is "one hundred eight million, seventy-eight thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •