Base | Representation |
---|---|
bin | 111010010000101000… |
… | …0110111110010110101 |
3 | 102221221021112100021122 |
4 | 1310201100313302311 |
5 | 4022212200410144 |
6 | 133250430553325 |
7 | 12016252331531 |
oct | 1644120676265 |
9 | 387837470248 |
10 | 125112122549 |
11 | 49072593497 |
12 | 202b7968845 |
13 | ba4b34245b |
14 | 60ac272bc1 |
15 | 33c3ba87ee |
hex | 1d21437cb5 |
125112122549 has 2 divisors, whose sum is σ = 125112122550. Its totient is φ = 125112122548.
The previous prime is 125112122441. The next prime is 125112122561. The reversal of 125112122549 is 945221211521.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98589720100 + 26522402449 = 313990^2 + 162857^2 .
It is an emirp because it is prime and its reverse (945221211521) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125112122549 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125112122249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62556061274 + 62556061275.
It is an arithmetic number, because the mean of its divisors is an integer number (62556061275).
Almost surely, 2125112122549 is an apocalyptic number.
It is an amenable number.
125112122549 is a deficient number, since it is larger than the sum of its proper divisors (1).
125112122549 is an equidigital number, since it uses as much as digits as its factorization.
125112122549 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14400, while the sum is 35.
The spelling of 125112122549 in words is "one hundred twenty-five billion, one hundred twelve million, one hundred twenty-two thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •