Base | Representation |
---|---|
bin | 111010010100111001… |
… | …1100110101100001001 |
3 | 102222022021012220002002 |
4 | 1310221303212230021 |
5 | 4023010343222012 |
6 | 133312550520345 |
7 | 12022642501145 |
oct | 1645163465411 |
9 | 388267186062 |
10 | 125255445257 |
11 | 49136484a08 |
12 | 203379660b5 |
13 | ba71c43ca7 |
14 | 60c3300225 |
15 | 33d15697c2 |
hex | 1d29ce6b09 |
125255445257 has 2 divisors, whose sum is σ = 125255445258. Its totient is φ = 125255445256.
The previous prime is 125255445221. The next prime is 125255445277. The reversal of 125255445257 is 752544552521.
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., 87701268736 + 37554176521 = 296144^2 + 193789^2 .
It is an emirp because it is prime and its reverse (752544552521) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 125255445257 - 26 = 125255445193 is a prime.
It is not a weakly prime, because it can be changed into another prime (125255445277) 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, 62627722628 + 62627722629.
It is an arithmetic number, because the mean of its divisors is an integer number (62627722629).
Almost surely, 2125255445257 is an apocalyptic number.
It is an amenable number.
125255445257 is a deficient number, since it is larger than the sum of its proper divisors (1).
125255445257 is an equidigital number, since it uses as much as digits as its factorization.
125255445257 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2800000, while the sum is 47.
Adding to 125255445257 its reverse (752544552521), we get a palindrome (877799997778).
The spelling of 125255445257 in words is "one hundred twenty-five billion, two hundred fifty-five million, four hundred forty-five thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •