Base | Representation |
---|---|
bin | 10000111110100… |
… | …01000100101101 |
3 | 100220222101110020 |
4 | 20133101010231 |
5 | 242424223000 |
6 | 22044232353 |
7 | 3346333350 |
oct | 1037210455 |
9 | 326871406 |
10 | 142414125 |
11 | 73430927 |
12 | 3b83b6b9 |
13 | 23674119 |
14 | 14cb2297 |
15 | c781ba0 |
hex | 87d112d |
142414125 has 64 divisors (see below), whose sum is σ = 273162240. Its totient is φ = 64545600.
The previous prime is 142414123. The next prime is 142414159. The reversal of 142414125 is 521414241.
It is not a de Polignac number, because 142414125 - 21 = 142414123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142414095 and 142414104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142414123) 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 63 ways as a sum of consecutive naturals, for example, 595756 + ... + 595994.
It is an arithmetic number, because the mean of its divisors is an integer number (4268160).
Almost surely, 2142414125 is an apocalyptic number.
142414125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
142414125 is a deficient number, since it is larger than the sum of its proper divisors (130748115).
142414125 is a wasteful number, since it uses less digits than its factorization.
142414125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 491 (or 481 counting only the distinct ones).
The product of its digits is 1280, while the sum is 24.
The square root of 142414125 is about 11933.7389363099. The cubic root of 142414125 is about 522.2170197577.
Adding to 142414125 its reverse (521414241), we get a palindrome (663828366).
The spelling of 142414125 in words is "one hundred forty-two million, four hundred fourteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •