Base | Representation |
---|---|
bin | 111010011001100000… |
… | …1010011100111011001 |
3 | 102222201001002201100022 |
4 | 1310303001103213121 |
5 | 4023314432011324 |
6 | 133340152120225 |
7 | 12026530453466 |
oct | 1646301234731 |
9 | 388631081308 |
10 | 125410032089 |
11 | 4920576a321 |
12 | 2037b696075 |
13 | ba97c8a8a4 |
14 | 60d9a6066d |
15 | 33dee0305e |
hex | 1d330539d9 |
125410032089 has 2 divisors, whose sum is σ = 125410032090. Its totient is φ = 125410032088.
The previous prime is 125410032023. The next prime is 125410032091. The reversal of 125410032089 is 980230014521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117896089600 + 7513942489 = 343360^2 + 86683^2 .
It is a cyclic number.
It is not a de Polignac number, because 125410032089 - 28 = 125410031833 is a prime.
It is a super-2 number, since 2×1254100320892 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 125410032091, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (125410032289) 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, 62705016044 + 62705016045.
It is an arithmetic number, because the mean of its divisors is an integer number (62705016045).
Almost surely, 2125410032089 is an apocalyptic number.
It is an amenable number.
125410032089 is a deficient number, since it is larger than the sum of its proper divisors (1).
125410032089 is an equidigital number, since it uses as much as digits as its factorization.
125410032089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 35.
The spelling of 125410032089 in words is "one hundred twenty-five billion, four hundred ten million, thirty-two thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •