Search a number
-
+
125617056000 = 2835319611129
BaseRepresentation
bin111010011111101011…
…1000010100100000000
3110000020110122121202120
41310333113002210000
54024230431243000
6133412505244240
712034623233652
oct1647727024400
9400213577676
10125617056000
114930160a467
1220418a93680
13bacbb33c47
1461193506d2
1534031986a0
hex1d3f5c2900

125617056000 has 576 divisors, whose sum is σ = 446792236800. Its totient is φ = 31186944000.

The previous prime is 125617055989. The next prime is 125617056001. The reversal of 125617056000 is 650716521.

It is not an unprimeable number, because it can be changed into a prime (125617056001) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 111263436 + ... + 111264564.

Almost surely, 2125617056000 is an apocalyptic number.

125617056000 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 125617056000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (223396118400).

125617056000 is an abundant number, since it is smaller than the sum of its proper divisors (321175180800).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

125617056000 is a wasteful number, since it uses less digits than its factorization.

125617056000 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1243 (or 1219 counting only the distinct ones).

The product of its (nonzero) digits is 12600, while the sum is 33.

The spelling of 125617056000 in words is "one hundred twenty-five billion, six hundred seventeen million, fifty-six thousand".