Base | Representation |
---|---|
bin | 1110111010101… |
… | …10000000100000 |
3 | 22201110101222100 |
4 | 13131112000200 |
5 | 224013222312 |
6 | 20230010400 |
7 | 3046416516 |
oct | 735260040 |
9 | 281411870 |
10 | 125132832 |
11 | 646a8170 |
12 | 35aa6a00 |
13 | 1cc032c6 |
14 | 128944b6 |
15 | aebb5dc |
hex | 7756020 |
125132832 has 72 divisors (see below), whose sum is σ = 388206000. Its totient is φ = 37918080.
The previous prime is 125132831. The next prime is 125132849. The reversal of 125132832 is 238231521.
It is a tau number, because it is divible by the number of its divisors (72).
It is a junction number, because it is equal to n+sod(n) for n = 125132796 and 125132805.
It is not an unprimeable number, because it can be changed into a prime (125132831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16582 + ... + 22917.
It is an arithmetic number, because the mean of its divisors is an integer number (5391750).
Almost surely, 2125132832 is an apocalyptic number.
125132832 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
125132832 is an abundant number, since it is smaller than the sum of its proper divisors (263073168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125132832 is a wasteful number, since it uses less digits than its factorization.
125132832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39526 (or 39515 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 125132832 is about 11186.2787378109. The cubic root of 125132832 is about 500.1770466349.
The spelling of 125132832 in words is "one hundred twenty-five million, one hundred thirty-two thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •