Base | Representation |
---|---|
bin | 1110111110101… |
… | …10001000100000 |
3 | 22202110001212101 |
4 | 13133112020200 |
5 | 224132021012 |
6 | 20245140144 |
7 | 3054033532 |
oct | 737261040 |
9 | 282401771 |
10 | 125657632 |
11 | 64a26491 |
12 | 360ba654 |
13 | 20058139 |
14 | 1298d852 |
15 | b071d57 |
hex | 77d6220 |
125657632 has 48 divisors (see below), whose sum is σ = 257064192. Its totient is φ = 60399360.
The previous prime is 125657593. The next prime is 125657639. The reversal of 125657632 is 236756521.
It is a junction number, because it is equal to n+sod(n) for n = 125657591 and 125657600.
It is not an unprimeable number, because it can be changed into a prime (125657639) 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 7 ways as a sum of consecutive naturals, for example, 195103 + ... + 195745.
It is an arithmetic number, because the mean of its divisors is an integer number (5355504).
Almost surely, 2125657632 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 125657632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128532096).
125657632 is an abundant number, since it is smaller than the sum of its proper divisors (131406560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125657632 is a wasteful number, since it uses less digits than its factorization.
125657632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 881 (or 873 counting only the distinct ones).
The product of its digits is 75600, while the sum is 37.
The square root of 125657632 is about 11209.7115038702. The cubic root of 125657632 is about 500.8753094393.
The spelling of 125657632 in words is "one hundred twenty-five million, six hundred fifty-seven thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •