Base | Representation |
---|---|
bin | 1101000010111001011101… |
… | …10000000001100001011101 |
3 | 10202120102211100122111001222 |
4 | 12201130232300001201131 |
5 | 12230001202423123234 |
6 | 141002322213343125 |
7 | 6020362255322360 |
oct | 641345660014135 |
9 | 122512740574058 |
10 | 28686870911069 |
11 | 9160040845048 |
12 | 327385b037aa5 |
13 | 13012112b6247 |
14 | 7126482720d7 |
15 | 34b32845342e |
hex | 1a172ec0185d |
28686870911069 has 16 divisors (see below), whose sum is σ = 34299752251392. Its totient is φ = 23458261448688.
The previous prime is 28686870911063. The next prime is 28686870911087. The reversal of 28686870911069 is 96011907868682.
It is a cyclic number.
It is not a de Polignac number, because 28686870911069 - 216 = 28686870845533 is a prime.
It is a super-2 number, since 2×286868709110692 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 28686870910993 and 28686870911011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28686870911063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 232548419 + ... + 232671744.
It is an arithmetic number, because the mean of its divisors is an integer number (2143734515712).
Almost surely, 228686870911069 is an apocalyptic number.
It is an amenable number.
28686870911069 is a deficient number, since it is larger than the sum of its proper divisors (5612881340323).
28686870911069 is a wasteful number, since it uses less digits than its factorization.
28686870911069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 465220576.
The product of its (nonzero) digits is 125411328, while the sum is 71.
The spelling of 28686870911069 in words is "twenty-eight trillion, six hundred eighty-six billion, eight hundred seventy million, nine hundred eleven thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •