Base | Representation |
---|---|
bin | 1101000110011000100110… |
… | …00001101001010011001111 |
3 | 10202222220001000002020121111 |
4 | 12203030103001221103033 |
5 | 12233432022200241222 |
6 | 141133333225312451 |
7 | 6032133003115441 |
oct | 643142301512317 |
9 | 122886030066544 |
10 | 28806664852687 |
11 | 91a6924359487 |
12 | 3292b11935727 |
13 | 130c5c28a4877 |
14 | 71837009a491 |
15 | 34e4da2a4777 |
hex | 1a33130694cf |
28806664852687 has 4 divisors (see below), whose sum is σ = 28807299951616. Its totient is φ = 28806029753760.
The previous prime is 28806664852643. The next prime is 28806664852711. The reversal of 28806664852687 is 78625846660882.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-28806664852687 is a prime.
It is a super-3 number, since 3×288066648526873 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28806664852387) 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, 317481423 + ... + 317572144.
It is an arithmetic number, because the mean of its divisors is an integer number (7201824987904).
Almost surely, 228806664852687 is an apocalyptic number.
28806664852687 is a deficient number, since it is larger than the sum of its proper divisors (635098929).
28806664852687 is an equidigital number, since it uses as much as digits as its factorization.
28806664852687 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 635098928.
The product of its (nonzero) digits is 2972712960, while the sum is 76.
The spelling of 28806664852687 in words is "twenty-eight trillion, eight hundred six billion, six hundred sixty-four million, eight hundred fifty-two thousand, six hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •