Base | Representation |
---|---|
bin | 110110010110010010… |
… | …101110001010000100 |
3 | 12120121221020020202001 |
4 | 312112102232022010 |
5 | 1424003123034100 |
6 | 42450340555044 |
7 | 4134055240000 |
oct | 662622561204 |
9 | 176557206661 |
10 | 58356064900 |
11 | 22826528311 |
12 | b3873b2a84 |
13 | 566ccb0723 |
14 | 2b78403700 |
15 | 17b8275d6a |
hex | d964ae284 |
58356064900 has 405 divisors, whose sum is σ = 162528442349. Its totient is φ = 18181524480.
The previous prime is 58356064801. The next prime is 58356064931. The reversal of 58356064900 is 946065385.
The square root of 58356064900 is 241570.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 19012548996 + 39343515904 = 137886^2 + 198352^2 .
It is a super-2 number, since 2×583560649002 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 2012278086 + ... + 2012278114.
Almost surely, 258356064900 is an apocalyptic number.
58356064900 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
58356064900 is the 241570-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 58356064900
58356064900 is an abundant number, since it is smaller than the sum of its proper divisors (104172377449).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58356064900 is a wasteful number, since it uses less digits than its factorization.
58356064900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134 (or 60 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 46.
The spelling of 58356064900 in words is "fifty-eight billion, three hundred fifty-six million, sixty-four thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •