Base | Representation |
---|---|
bin | 1110111011100… |
… | …00101101011000 |
3 | 22201122222000000 |
4 | 13131300231120 |
5 | 224030222300 |
6 | 20232213000 |
7 | 3050353416 |
oct | 735605530 |
9 | 281588000 |
10 | 125242200 |
11 | 64772356 |
12 | 35b3a160 |
13 | 1cc41015 |
14 | 128c22b6 |
15 | aeddc00 |
hex | 7770b58 |
125242200 has 168 divisors, whose sum is σ = 437090700. Its totient is φ = 33359040.
The previous prime is 125242181. The next prime is 125242207. The reversal of 125242200 is 2242521.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125242207) by changing a digit.
It is a polite number, since it can be written in 41 ways as a sum of consecutive naturals, for example, 145371 + ... + 146229.
Almost surely, 2125242200 is an apocalyptic number.
125242200 is a gapful number since it is divisible by the number (10) 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 125242200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (218545350).
125242200 is an abundant number, since it is smaller than the sum of its proper divisors (311848500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125242200 is an equidigital number, since it uses as much as digits as its factorization.
125242200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 893 (or 869 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 18.
The square root of 125242200 is about 11191.1661590739. The cubic root of 125242200 is about 500.3227249857.
Adding to 125242200 its reverse (2242521), we get a palindrome (127484721).
The spelling of 125242200 in words is "one hundred twenty-five million, two hundred forty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •