Base | Representation |
---|---|
bin | 1110111110010… |
… | …00001001000101 |
3 | 22202100011020220 |
4 | 13133020021011 |
5 | 224123202300 |
6 | 20244014553 |
7 | 3053404464 |
oct | 737101105 |
9 | 282304226 |
10 | 125600325 |
11 | 64997424 |
12 | 36091459 |
13 | 20038026 |
14 | 129769db |
15 | b05eda0 |
hex | 77c8245 |
125600325 has 24 divisors (see below), whose sum is σ = 208165248. Its totient is φ = 66823680.
The previous prime is 125600303. The next prime is 125600329. The reversal of 125600325 is 523006521.
It is not a de Polignac number, because 125600325 - 27 = 125600197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125600295 and 125600304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125600329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32917 + ... + 36533.
It is an arithmetic number, because the mean of its divisors is an integer number (8673552).
Almost surely, 2125600325 is an apocalyptic number.
125600325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
125600325 is a deficient number, since it is larger than the sum of its proper divisors (82564923).
125600325 is a wasteful number, since it uses less digits than its factorization.
125600325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4093 (or 4088 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 125600325 is about 11207.1550805724. The cubic root of 125600325 is about 500.7991553543.
Adding to 125600325 its reverse (523006521), we get a palindrome (648606846).
The spelling of 125600325 in words is "one hundred twenty-five million, six hundred thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •