Base | Representation |
---|---|
bin | 1100110101100… |
… | …01110000111000 |
3 | 21111121212010112 |
4 | 12122301300320 |
5 | 210031322442 |
6 | 14404003452 |
7 | 2445201143 |
oct | 632616070 |
9 | 244555115 |
10 | 107682872 |
11 | 55869810 |
12 | 30090588 |
13 | 1940379b |
14 | 1043105a |
15 | 96c1082 |
hex | 66b1c38 |
107682872 has 64 divisors (see below), whose sum is σ = 232968960. Its totient is φ = 46182400.
The previous prime is 107682863. The next prime is 107682881. The reversal of 107682872 is 278286701.
It is an interprime number because it is at equal distance from previous prime (107682863) and next prime (107682881).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 167672 + ... + 168312.
It is an arithmetic number, because the mean of its divisors is an integer number (3640140).
Almost surely, 2107682872 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 107682872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116484480).
107682872 is an abundant number, since it is smaller than the sum of its proper divisors (125286088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107682872 is a wasteful number, since it uses less digits than its factorization.
107682872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764 (or 760 counting only the distinct ones).
The product of its (nonzero) digits is 75264, while the sum is 41.
The square root of 107682872 is about 10377.0358002659. The cubic root of 107682872 is about 475.7537388698.
The spelling of 107682872 in words is "one hundred seven million, six hundred eighty-two thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •