Base | Representation |
---|---|
bin | 1110111111011… |
… | …00111010010001 |
3 | 22202121210211211 |
4 | 13133230322101 |
5 | 224143012204 |
6 | 20251140121 |
7 | 3054602533 |
oct | 737547221 |
9 | 282553754 |
10 | 125750929 |
11 | 64a8a597 |
12 | 36144641 |
13 | 2008b745 |
14 | 129b5853 |
15 | b08e804 |
hex | 77ece91 |
125750929 has 2 divisors, whose sum is σ = 125750930. Its totient is φ = 125750928.
The previous prime is 125750923. The next prime is 125750953. The reversal of 125750929 is 929057521.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94614529 + 31136400 = 9727^2 + 5580^2 .
It is a cyclic number.
It is not a de Polignac number, because 125750929 - 225 = 92196497 is a prime.
It is a super-2 number, since 2×1257509292 = 31626592288726082, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 125750891 and 125750900.
It is not a weakly prime, because it can be changed into another prime (125750923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62875464 + 62875465.
It is an arithmetic number, because the mean of its divisors is an integer number (62875465).
Almost surely, 2125750929 is an apocalyptic number.
It is an amenable number.
125750929 is a deficient number, since it is larger than the sum of its proper divisors (1).
125750929 is an equidigital number, since it uses as much as digits as its factorization.
125750929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56700, while the sum is 40.
The square root of 125750929 is about 11213.8721679891. The cubic root of 125750929 is about 500.9992403737. Note that the first 3 decimals are identical.
The spelling of 125750929 in words is "one hundred twenty-five million, seven hundred fifty thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •