Base | Representation |
---|---|
bin | 111001111111001001… |
… | …0110110110010011101 |
3 | 102220102101120210100011 |
4 | 1303332102312302131 |
5 | 4020012003041112 |
6 | 133112312203221 |
7 | 11665566530326 |
oct | 1637622666235 |
9 | 386371523304 |
10 | 124525440157 |
11 | 488a1401308 |
12 | 20173399511 |
13 | b98692a501 |
14 | 605439544d |
15 | 338c41baa7 |
hex | 1cfe4b6c9d |
124525440157 has 2 divisors, whose sum is σ = 124525440158. Its totient is φ = 124525440156.
The previous prime is 124525440119. The next prime is 124525440163. The reversal of 124525440157 is 751044525421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113537998116 + 10987442041 = 336954^2 + 104821^2 .
It is an emirp because it is prime and its reverse (751044525421) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 124525440157 - 215 = 124525407389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (124525440187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62262720078 + 62262720079.
It is an arithmetic number, because the mean of its divisors is an integer number (62262720079).
Almost surely, 2124525440157 is an apocalyptic number.
It is an amenable number.
124525440157 is a deficient number, since it is larger than the sum of its proper divisors (1).
124525440157 is an equidigital number, since it uses as much as digits as its factorization.
124525440157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224000, while the sum is 40.
Adding to 124525440157 its reverse (751044525421), we get a palindrome (875569965578).
The spelling of 124525440157 in words is "one hundred twenty-four billion, five hundred twenty-five million, four hundred forty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •