Base | Representation |
---|---|
bin | 11010010101111100… |
… | …101011011100010001 |
3 | 2201000021012001211120 |
4 | 122111330223130101 |
5 | 430412042444122 |
6 | 20554424432453 |
7 | 2020640625606 |
oct | 322574533421 |
9 | 81007161746 |
10 | 28285515537 |
11 | 10aa5488524 |
12 | 5594918729 |
13 | 288a116a56 |
14 | 15248726ad |
15 | b0836375c |
hex | 695f2b711 |
28285515537 has 8 divisors (see below), whose sum is σ = 37715262336. Its totient is φ = 18856389552.
The previous prime is 28285515481. The next prime is 28285515589. The reversal of 28285515537 is 73551558282.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 28285515537 - 227 = 28151297809 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 28285515537.
It is not an unprimeable number, because it can be changed into a prime (28285517537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35758 + ... + 240519.
It is an arithmetic number, because the mean of its divisors is an integer number (4714407792).
Almost surely, 228285515537 is an apocalyptic number.
It is an amenable number.
28285515537 is a deficient number, since it is larger than the sum of its proper divisors (9429746799).
28285515537 is a wasteful number, since it uses less digits than its factorization.
28285515537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310407.
The product of its digits is 3360000, while the sum is 51.
The spelling of 28285515537 in words is "twenty-eight billion, two hundred eighty-five million, five hundred fifteen thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •