Search a number
-
+
58064160000 = 283547111571
BaseRepresentation
bin110110000100111001…
…001100010100000000
312112212120221221111110
4312010321030110000
51422403411110000
642401352243320
74123612134210
oct660471142400
9175776857443
1058064160000
11226967828a0
12b3056a0540
135624688432
142b4b73a240
15179c815850
hexd84e4c500

58064160000 has 720 divisors, whose sum is σ = 240910483968. Its totient is φ = 12057600000.

The previous prime is 58064159987. The next prime is 58064160043. The reversal of 58064160000 is 6146085.

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

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 36959215 + ... + 36960785.

Almost surely, 258064160000 is an apocalyptic number.

58064160000 is a gapful number since it is divisible by the number (50) 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 58064160000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120455241984).

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

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

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

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

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

The product of its (nonzero) digits is 5760, while the sum is 30.

The spelling of 58064160000 in words is "fifty-eight billion, sixty-four million, one hundred sixty thousand".