Search a number
-
+
125485056000 = 21732532337
BaseRepresentation
bin111010011011101111…
…1100000000000000000
3102222220021021022210200
41310313133200000000
54023443133243000
6133351432125200
712031431243213
oct1646737400000
9388807238720
10125485056000
1149244051957
12203a0836800
13baaa698035
1461059cd77a
1533e67c2500
hex1d377e0000

125485056000 has 864 divisors, whose sum is σ = 484842915648. Its totient is φ = 31142707200.

The previous prime is 125485055981. The next prime is 125485056041. The reversal of 125485056000 is 650584521.

125485056000 is a `hidden beast` number, since 1 + 2 + 5 + 48 + 5 + 0 + 5 + 600 + 0 = 666.

It is a Harshad number since it is a multiple of its sum of digits (36).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3391487982 + ... + 3391488018.

It is an arithmetic number, because the mean of its divisors is an integer number (561160782).

Almost surely, 2125485056000 is an apocalyptic number.

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

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

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

125485056000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 48000, while the sum is 36.

The spelling of 125485056000 in words is "one hundred twenty-five billion, four hundred eighty-five million, fifty-six thousand".