Base | Representation |
---|---|
bin | 101010001010000… |
… | …0010101101011101 |
3 | 10122120201002021000 |
4 | 1110110002231131 |
5 | 10344110241000 |
6 | 352210300513 |
7 | 50024251455 |
oct | 12424025535 |
9 | 3576632230 |
10 | 1414540125 |
11 | 66651aa29 |
12 | 335887739 |
13 | 19709c9bb |
14 | d5c18d65 |
15 | 842b8000 |
hex | 54502b5d |
1414540125 has 64 divisors (see below), whose sum is σ = 2626341120. Its totient is φ = 751248000.
The previous prime is 1414540123. The next prime is 1414540129. The reversal of 1414540125 is 5210454141.
It is not a de Polignac number, because 1414540125 - 21 = 1414540123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414540123) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 954385 + ... + 955865.
It is an arithmetic number, because the mean of its divisors is an integer number (41036580).
Almost surely, 21414540125 is an apocalyptic number.
1414540125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1414540125 is a deficient number, since it is larger than the sum of its proper divisors (1211800995).
1414540125 is a wasteful number, since it uses less digits than its factorization.
1414540125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1788 (or 1772 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
The square root of 1414540125 is about 37610.3725719382. The cubic root of 1414540125 is about 1122.5484393030.
Adding to 1414540125 its reverse (5210454141), we get a palindrome (6624994266).
The spelling of 1414540125 in words is "one billion, four hundred fourteen million, five hundred forty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •