Base | Representation |
---|---|
bin | 1100110111111… |
… | …00000100010001 |
3 | 21112012022121120 |
4 | 12123330010101 |
5 | 210121042332 |
6 | 14414312453 |
7 | 2450606352 |
oct | 633740421 |
9 | 245168546 |
10 | 107987217 |
11 | 55a57438 |
12 | 301b8729 |
13 | 194ac180 |
14 | 104add29 |
15 | 973132c |
hex | 66fc111 |
107987217 has 8 divisors (see below), whose sum is σ = 155058624. Its totient is φ = 66453648.
The previous prime is 107987137. The next prime is 107987219. The reversal of 107987217 is 712789701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107987217 - 28 = 107986961 is a prime.
It is a super-2 number, since 2×1079872172 = 23322478070810178, which contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (107987219) 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, 1384413 + ... + 1384490.
It is an arithmetic number, because the mean of its divisors is an integer number (19382328).
Almost surely, 2107987217 is an apocalyptic number.
It is an amenable number.
107987217 is a deficient number, since it is larger than the sum of its proper divisors (47071407).
107987217 is a wasteful number, since it uses less digits than its factorization.
107987217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2768919.
The product of its (nonzero) digits is 49392, while the sum is 42.
The square root of 107987217 is about 10391.6898048392. The cubic root of 107987217 is about 476.2015261939.
The spelling of 107987217 in words is "one hundred seven million, nine hundred eighty-seven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •