Base | Representation |
---|---|
bin | 1110111010101… |
… | …10101101011111 |
3 | 22201110112220222 |
4 | 13131112231133 |
5 | 224013320321 |
6 | 20230031555 |
7 | 3046431101 |
oct | 735265537 |
9 | 281415828 |
10 | 125135711 |
11 | 646aa348 |
12 | 35aa85bb |
13 | 1cc046cc |
14 | 12895571 |
15 | aebc3ab |
hex | 7756b5f |
125135711 has 2 divisors, whose sum is σ = 125135712. Its totient is φ = 125135710.
The previous prime is 125135707. The next prime is 125135737. The reversal of 125135711 is 117531521.
It is an a-pointer prime, because the next prime (125135737) can be obtained adding 125135711 to its sum of digits (26).
It is a weak prime.
It is an emirp because it is prime and its reverse (117531521) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 125135711 - 22 = 125135707 is a prime.
It is a super-3 number, since 3×1251357113 (a number of 25 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125135741) 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, 62567855 + 62567856.
It is an arithmetic number, because the mean of its divisors is an integer number (62567856).
Almost surely, 2125135711 is an apocalyptic number.
125135711 is a deficient number, since it is larger than the sum of its proper divisors (1).
125135711 is an equidigital number, since it uses as much as digits as its factorization.
125135711 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1050, while the sum is 26.
The square root of 125135711 is about 11186.4074215094. The cubic root of 125135711 is about 500.1808825551.
The spelling of 125135711 in words is "one hundred twenty-five million, one hundred thirty-five thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •