Base | Representation |
---|---|
bin | 1111000100011… |
… | …10100101000101 |
3 | 22210212110012121 |
4 | 13202032211011 |
5 | 224330210000 |
6 | 20313245541 |
7 | 3063331246 |
oct | 742164505 |
9 | 283773177 |
10 | 126413125 |
11 | 653a2063 |
12 | 364038b1 |
13 | 20260c87 |
14 | 12b08ccd |
15 | b170b1a |
hex | 788e945 |
126413125 has 20 divisors (see below), whose sum is σ = 158849152. Its totient is φ = 100566000.
The previous prime is 126413107. The next prime is 126413143. The reversal of 126413125 is 521314621.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (126413107) and next prime (126413143).
It is not a de Polignac number, because 126413125 - 27 = 126412997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 126413125.
It is a congruent number.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 138922 + ... + 139828.
Almost surely, 2126413125 is an apocalyptic number.
It is an amenable number.
126413125 is a deficient number, since it is larger than the sum of its proper divisors (32436027).
126413125 is an frugal number, since it uses more digits than its factorization.
126413125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1150 (or 1135 counting only the distinct ones).
The product of its digits is 1440, while the sum is 25.
The square root of 126413125 is about 11243.3591510722. The cubic root of 126413125 is about 501.8771107583.
Adding to 126413125 its reverse (521314621), we get a palindrome (647727746).
The spelling of 126413125 in words is "one hundred twenty-six million, four hundred thirteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •