Base | Representation |
---|---|
bin | 111010010000110010… |
… | …0010011100100010001 |
3 | 102221221122010011121112 |
4 | 1310201210103210101 |
5 | 4022220001421131 |
6 | 133251132103105 |
7 | 12016343540345 |
oct | 1644144234421 |
9 | 387848104545 |
10 | 125117217041 |
11 | 49075453013 |
12 | 202b9604a95 |
13 | ba4c40724b |
14 | 60acbdb625 |
15 | 33c436302b |
hex | 1d21913911 |
125117217041 has 2 divisors, whose sum is σ = 125117217042. Its totient is φ = 125117217040.
The previous prime is 125117217037. The next prime is 125117217073. The reversal of 125117217041 is 140712711521.
It is an a-pointer prime, because the next prime (125117217073) can be obtained adding 125117217041 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99054343441 + 26062873600 = 314729^2 + 161440^2 .
It is a cyclic number.
It is not a de Polignac number, because 125117217041 - 22 = 125117217037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125117216989 and 125117217007.
It is not a weakly prime, because it can be changed into another prime (125117217011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62558608520 + 62558608521.
It is an arithmetic number, because the mean of its divisors is an integer number (62558608521).
Almost surely, 2125117217041 is an apocalyptic number.
It is an amenable number.
125117217041 is a deficient number, since it is larger than the sum of its proper divisors (1).
125117217041 is an equidigital number, since it uses as much as digits as its factorization.
125117217041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3920, while the sum is 32.
Adding to 125117217041 its reverse (140712711521), we get a palindrome (265829928562).
The spelling of 125117217041 in words is "one hundred twenty-five billion, one hundred seventeen million, two hundred seventeen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •