Base | Representation |
---|---|
bin | 1100110011110… |
… | …01010000100101 |
3 | 21111012002122120 |
4 | 12121321100211 |
5 | 210001421204 |
6 | 14355020153 |
7 | 2443215321 |
oct | 631712045 |
9 | 244162576 |
10 | 107451429 |
11 | 55720938 |
12 | 2bb9a659 |
13 | 19352337 |
14 | 103b0981 |
15 | 96776d9 |
hex | 6679425 |
107451429 has 8 divisors (see below), whose sum is σ = 144314880. Its totient is φ = 71111136.
The previous prime is 107451397. The next prime is 107451457. The reversal of 107451429 is 924154701.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107451429 - 25 = 107451397 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 107451429.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107451629) 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, 130309 + ... + 131130.
It is an arithmetic number, because the mean of its divisors is an integer number (18039360).
Almost surely, 2107451429 is an apocalyptic number.
It is an amenable number.
107451429 is a deficient number, since it is larger than the sum of its proper divisors (36863451).
107451429 is a wasteful number, since it uses less digits than its factorization.
107451429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261579.
The product of its (nonzero) digits is 10080, while the sum is 33.
The square root of 107451429 is about 10365.8781104159. The cubic root of 107451429 is about 475.4126482478.
It can be divided in two parts, 107451 and 429, that added together give a triangular number (107880 = T464).
The spelling of 107451429 in words is "one hundred seven million, four hundred fifty-one thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •