Base | Representation |
---|---|
bin | 1110111100011… |
… | …10110000000000 |
3 | 22201220012210100 |
4 | 13132032300000 |
5 | 224043141443 |
6 | 20235002400 |
7 | 3051405231 |
oct | 736166000 |
9 | 281805710 |
10 | 125365248 |
11 | 64846848 |
12 | 35b99400 |
13 | 1cc85028 |
14 | 12915088 |
15 | b0153d3 |
hex | 778ec00 |
125365248 has 132 divisors (see below), whose sum is σ = 369573568. Its totient is φ = 40919040.
The previous prime is 125365237. The next prime is 125365283. The reversal of 125365248 is 842563521.
125365248 is a `hidden beast` number, since 125 + 3 + 6 + 524 + 8 = 666.
It is a super-2 number, since 2×1253652482 = 31432890812203008, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 562065 + ... + 562287.
Almost surely, 2125365248 is an apocalyptic number.
125365248 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 125365248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184786784).
125365248 is an abundant number, since it is smaller than the sum of its proper divisors (244208320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125365248 is a wasteful number, since it uses less digits than its factorization.
125365248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 310 (or 289 counting only the distinct ones).
The product of its digits is 57600, while the sum is 36.
The square root of 125365248 is about 11196.6623598285. The cubic root of 125365248 is about 500.4865237690.
The spelling of 125365248 in words is "one hundred twenty-five million, three hundred sixty-five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •