Base | Representation |
---|---|
bin | 1110111011100… |
… | …10111011001111 |
3 | 22201200102110021 |
4 | 13131302323033 |
5 | 224031020104 |
6 | 20232323011 |
7 | 3050422036 |
oct | 735627317 |
9 | 281612407 |
10 | 125251279 |
11 | 6477915a |
12 | 35b43467 |
13 | 1cc451aa |
14 | 128c571d |
15 | aee1754 |
hex | 7772ecf |
125251279 has 2 divisors, whose sum is σ = 125251280. Its totient is φ = 125251278.
The previous prime is 125251271. The next prime is 125251297. The reversal of 125251279 is 972152521.
Together with next prime (125251297) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (972152521) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 125251279 - 23 = 125251271 is a prime.
It is a super-4 number, since 4×1252512794 (a number of 33 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125251271) 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, 62625639 + 62625640.
It is an arithmetic number, because the mean of its divisors is an integer number (62625640).
Almost surely, 2125251279 is an apocalyptic number.
125251279 is a deficient number, since it is larger than the sum of its proper divisors (1).
125251279 is an equidigital number, since it uses as much as digits as its factorization.
125251279 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12600, while the sum is 34.
The square root of 125251279 is about 11191.5717841597. The cubic root of 125251279 is about 500.3348144152.
The spelling of 125251279 in words is "one hundred twenty-five million, two hundred fifty-one thousand, two hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •