Base | Representation |
---|---|
bin | 1110111010000… |
… | …01001110000000 |
3 | 22201022002011120 |
4 | 13131001032000 |
5 | 224003011210 |
6 | 20224112240 |
7 | 3045613332 |
oct | 735011600 |
9 | 281262146 |
10 | 125047680 |
11 | 6464a19a |
12 | 35a65680 |
13 | 1cba3614 |
14 | 12871452 |
15 | aea1270 |
hex | 7741380 |
125047680 has 64 divisors (see below), whose sum is σ = 398595600. Its totient is φ = 33345536.
The previous prime is 125047669. The next prime is 125047691. The reversal of 125047680 is 86740521.
It is an interprime number because it is at equal distance from previous prime (125047669) and next prime (125047691).
It is a tau number, because it is divible by the number of its divisors (64).
It is a hoax number, since the sum of its digits (33) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 30645 + ... + 34484.
Almost surely, 2125047680 is an apocalyptic number.
125047680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
125047680 is an abundant number, since it is smaller than the sum of its proper divisors (273547920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125047680 is an equidigital number, since it uses as much as digits as its factorization.
125047680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65151 (or 65139 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 33.
The square root of 125047680 is about 11182.4719986236. The cubic root of 125047680 is about 500.0635652519.
The spelling of 125047680 in words is "one hundred twenty-five million, forty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •