Base | Representation |
---|---|
bin | 101010001001110… |
… | …1101001110011101 |
3 | 10122120112121112202 |
4 | 1110103231032131 |
5 | 10344044432000 |
6 | 352204341245 |
7 | 50023434062 |
oct | 12423551635 |
9 | 3576477482 |
10 | 1414452125 |
11 | 66646a8a9 |
12 | 335844825 |
13 | 19706b928 |
14 | d5bd4c69 |
15 | 8429bdd5 |
hex | 544ed39d |
1414452125 has 16 divisors (see below), whose sum is σ = 1781448240. Its totient is φ = 1121169600.
The previous prime is 1414452121. The next prime is 1414452167. The reversal of 1414452125 is 5212544141.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 662650564 + 751801561 = 25742^2 + 27419^2 .
It is not a de Polignac number, because 1414452125 - 22 = 1414452121 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414452121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38282 + ... + 65531.
It is an arithmetic number, because the mean of its divisors is an integer number (111340515).
Almost surely, 21414452125 is an apocalyptic number.
It is an amenable number.
1414452125 is a deficient number, since it is larger than the sum of its proper divisors (366996115).
1414452125 is a wasteful number, since it uses less digits than its factorization.
1414452125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103937 (or 103927 counting only the distinct ones).
The product of its digits is 6400, while the sum is 29.
The square root of 1414452125 is about 37609.2026637098. The cubic root of 1414452125 is about 1122.5251605215.
Adding to 1414452125 its reverse (5212544141), we get a palindrome (6626996266).
The spelling of 1414452125 in words is "one billion, four hundred fourteen million, four hundred fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •