Base | Representation |
---|---|
bin | 1100111101111110000111… |
… | …10110000011011110000001 |
3 | 10201222020211201220021011001 |
4 | 12132333003312003132001 |
5 | 12214212442320331444 |
6 | 140352443100452001 |
7 | 6002220026056321 |
oct | 636770366033601 |
9 | 121866751807131 |
10 | 28517573605249 |
11 | 90a5264937473 |
12 | 3246a9184a001 |
13 | 12bb270b02941 |
14 | 708387a75281 |
15 | 346c1a65d8d4 |
hex | 19efc3d83781 |
28517573605249 has 4 divisors (see below), whose sum is σ = 28522215899136. Its totient is φ = 28512931311364.
The previous prime is 28517573605219. The next prime is 28517573605289. The reversal of 28517573605249 is 94250637571582.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 28517573605249 - 213 = 28517573597057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (28517573605219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2321137729 + ... + 2321150014.
It is an arithmetic number, because the mean of its divisors is an integer number (7130553974784).
It is a 1-persistent number, because it is pandigital, but 2⋅28517573605249 = 57035147210498 is not.
Almost surely, 228517573605249 is an apocalyptic number.
It is an amenable number.
28517573605249 is a deficient number, since it is larger than the sum of its proper divisors (4642293887).
28517573605249 is an equidigital number, since it uses as much as digits as its factorization.
28517573605249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4642293886.
The product of its (nonzero) digits is 127008000, while the sum is 64.
The spelling of 28517573605249 in words is "twenty-eight trillion, five hundred seventeen billion, five hundred seventy-three million, six hundred five thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •