Base | Representation |
---|---|
bin | 1101000100111110000011… |
… | …01101110100011010101101 |
3 | 10202211020120101001202110020 |
4 | 12202133001231310122231 |
5 | 12232132444322414324 |
6 | 141055134002232353 |
7 | 6025462303156422 |
oct | 642370155643255 |
9 | 122736511052406 |
10 | 28758056060589 |
11 | 918824aa1a529 |
12 | 32856069556b9 |
13 | 1307b471257ab |
14 | 715c7c42dd49 |
15 | 34d0e2b19679 |
hex | 1a27c1b746ad |
28758056060589 has 8 divisors (see below), whose sum is σ = 38403893899392. Its totient is φ = 19142127797760.
The previous prime is 28758056060561. The next prime is 28758056060599. The reversal of 28758056060589 is 98506065085782.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 28758056060589 - 221 = 28758053963437 is a prime.
It is a Smith number, since the sum of its digits (69) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28758056060509) 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, 7477391749 + ... + 7477395594.
It is an arithmetic number, because the mean of its divisors is an integer number (4800486737424).
Almost surely, 228758056060589 is an apocalyptic number.
It is an amenable number.
28758056060589 is a deficient number, since it is larger than the sum of its proper divisors (9645837838803).
28758056060589 is a wasteful number, since it uses less digits than its factorization.
28758056060589 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14954787987.
The product of its (nonzero) digits is 290304000, while the sum is 69.
The spelling of 28758056060589 in words is "twenty-eight trillion, seven hundred fifty-eight billion, fifty-six million, sixty thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •