Base | Representation |
---|---|
bin | 111010011010001001… |
… | …1010000010001011000 |
3 | 102222202112112010021001 |
4 | 1310310103100101120 |
5 | 4023340431423300 |
6 | 133342240354344 |
7 | 12030211164526 |
oct | 1646423202130 |
9 | 388675463231 |
10 | 125431514200 |
11 | 49216902133 |
12 | 203869159b4 |
13 | ba9c56c7b5 |
14 | 60dc853316 |
15 | 33e1c4816a |
hex | 1d344d0458 |
125431514200 has 96 divisors (see below), whose sum is σ = 294481152000. Its totient is φ = 49682626560.
The previous prime is 125431514161. The next prime is 125431514297. The reversal of 125431514200 is 2415134521.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 35005609 + ... + 35009191.
It is an arithmetic number, because the mean of its divisors is an integer number (3067512000).
Almost surely, 2125431514200 is an apocalyptic number.
125431514200 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 125431514200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147240576000).
125431514200 is an abundant number, since it is smaller than the sum of its proper divisors (169049637800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125431514200 is a wasteful number, since it uses less digits than its factorization.
125431514200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5261 (or 5252 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 125431514200 its reverse (2415134521), we get a palindrome (127846648721).
The spelling of 125431514200 in words is "one hundred twenty-five billion, four hundred thirty-one million, five hundred fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •