Base | Representation |
---|---|
bin | 110110100100100010… |
… | …011100101011111000 |
3 | 12121020120221220021022 |
4 | 312210202130223320 |
5 | 1430000314144124 |
6 | 42530155402012 |
7 | 4143016602656 |
oct | 664442345370 |
9 | 177216856238 |
10 | 58595068664 |
11 | 22939430390 |
12 | b433453308 |
13 | 56aa672c82 |
14 | 2b9c059dd6 |
15 | 17ce236c5e |
hex | da489caf8 |
58595068664 has 32 divisors (see below), whose sum is σ = 119996553600. Its totient is φ = 26602343520.
The previous prime is 58595068657. The next prime is 58595068667. The reversal of 58595068664 is 46686059585.
58595068664 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 58595068597 and 58595068606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58595068667) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 322982 + ... + 470645.
It is an arithmetic number, because the mean of its divisors is an integer number (3749892300).
Almost surely, 258595068664 is an apocalyptic number.
It is an amenable number.
58595068664 is an abundant number, since it is smaller than the sum of its proper divisors (61401484936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58595068664 is a wasteful number, since it uses less digits than its factorization.
58595068664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 794483 (or 794479 counting only the distinct ones).
The product of its (nonzero) digits is 62208000, while the sum is 62.
The spelling of 58595068664 in words is "fifty-eight billion, five hundred ninety-five million, sixty-eight thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •