Search a number
-
+
59160351072 = 25319411276229
BaseRepresentation
bin110111000110001110…
…110101000101100000
312122200222122012221210
4313012032311011200
51432130022213242
643102231350120
74163022454434
oct670616650540
9178628565853
1059160351072
11230a9526429
12b570822340
13576a8044c4
142c131669c4
151813b97d9c
hexdc63b5160

59160351072 has 192 divisors, whose sum is σ = 168802099200. Its totient is φ = 18080133120.

The previous prime is 59160351043. The next prime is 59160351079. The reversal of 59160351072 is 27015306195.

It is a self number, because there is not a number n which added to its sum of digits gives 59160351072.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (59160351079) 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 31 ways as a sum of consecutive naturals, for example, 9494454 + ... + 9500682.

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

Almost surely, 259160351072 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 59160351072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84401049600).

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

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

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

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

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

The product of its (nonzero) digits is 56700, while the sum is 39.

The spelling of 59160351072 in words is "fifty-nine billion, one hundred sixty million, three hundred fifty-one thousand, seventy-two".