Base | Representation |
---|---|
bin | 1110111010110… |
… | …01000000011001 |
3 | 22201111000211012 |
4 | 13131121000121 |
5 | 224014120423 |
6 | 20230143305 |
7 | 3046500362 |
oct | 735310031 |
9 | 281430735 |
10 | 125145113 |
11 | 64706415 |
12 | 35ab1b35 |
13 | 1cc08a82 |
14 | 12898b69 |
15 | aec0078 |
hex | 7759019 |
125145113 has 2 divisors, whose sum is σ = 125145114. Its totient is φ = 125145112.
The previous prime is 125145091. The next prime is 125145149. The reversal of 125145113 is 311541521.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69672409 + 55472704 = 8347^2 + 7448^2 .
It is a cyclic number.
It is not a de Polignac number, because 125145113 - 26 = 125145049 is a prime.
It is a super-2 number, since 2×1251451132 = 31322598615565538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (125145193) 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 as a sum of consecutive naturals, namely, 62572556 + 62572557.
It is an arithmetic number, because the mean of its divisors is an integer number (62572557).
Almost surely, 2125145113 is an apocalyptic number.
It is an amenable number.
125145113 is a deficient number, since it is larger than the sum of its proper divisors (1).
125145113 is an equidigital number, since it uses as much as digits as its factorization.
125145113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 600, while the sum is 23.
The square root of 125145113 is about 11186.8276557744. The cubic root of 125145113 is about 500.1934091761.
Adding to 125145113 its reverse (311541521), we get a palindrome (436686634).
It can be divided in two parts, 1251 and 45113, that added together give a palindrome (46364).
The spelling of 125145113 in words is "one hundred twenty-five million, one hundred forty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •