Search a number
-
+
59168093952 = 28311219233147
BaseRepresentation
bin110111000110101100…
…010111011100000000
312122201112012121012010
4313012230113130000
51432134013001302
643103105332520
74163145333432
oct670654273400
9178645177163
1059168093952
1123102934800
12b573337140
13576c2b58a6
142c141c0652
1518146c716c
hexdc6b17700

59168093952 has 864 divisors, whose sum is σ = 200431042560. Its totient is φ = 15388876800.

The previous prime is 59168093867. The next prime is 59168093993. The reversal of 59168093952 is 25939086195.

It is a super-3 number, since 3×591680939523 (a number of 33 digits) contains 333 as substring.

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

It is a junction number, because it is equal to n+sod(n) for n = 59168093892 and 59168093901.

It is a congruent number.

It is an unprimeable number.

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 95 ways as a sum of consecutive naturals, for example, 1258895593 + ... + 1258895639.

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

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

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

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

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

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

The product of its (nonzero) digits is 5248800, while the sum is 57.

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