Base | Representation |
---|---|
bin | 1100110011100… |
… | …11010100111001 |
3 | 21111010212022120 |
4 | 12121303110321 |
5 | 210000132004 |
6 | 14354311453 |
7 | 2443054425 |
oct | 631632471 |
9 | 244125276 |
10 | 107427129 |
11 | 55704657 |
12 | 2bb88589 |
13 | 19344264 |
14 | 103a5b85 |
15 | 96703d9 |
hex | 6673539 |
107427129 has 8 divisors (see below), whose sum is σ = 143332992. Its totient is φ = 71569680.
The previous prime is 107427127. The next prime is 107427157. The reversal of 107427129 is 921724701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107427129 - 21 = 107427127 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 107427129.
It is not an unprimeable number, because it can be changed into a prime (107427127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6562 + ... + 16059.
It is an arithmetic number, because the mean of its divisors is an integer number (17916624).
Almost surely, 2107427129 is an apocalyptic number.
It is an amenable number.
107427129 is a deficient number, since it is larger than the sum of its proper divisors (35905863).
107427129 is a wasteful number, since it uses less digits than its factorization.
107427129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24207.
The product of its (nonzero) digits is 7056, while the sum is 33.
The square root of 107427129 is about 10364.7059292582. The cubic root of 107427129 is about 475.3768075633.
It can be divided in two parts, 10742 and 7129, that added together give a palindrome (17871).
The spelling of 107427129 in words is "one hundred seven million, four hundred twenty-seven thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •