Base | Representation |
---|---|
bin | 11010110100111101… |
… | …010010000111100101 |
3 | 2202100112010121120110 |
4 | 122310331102013211 |
5 | 432443234031103 |
6 | 21122211323233 |
7 | 2036555661615 |
oct | 326475220745 |
9 | 82315117513 |
10 | 28805767653 |
11 | 11242117653 |
12 | 56babb0519 |
13 | 2940b3cc40 |
14 | 15739baa45 |
15 | b38d7c403 |
hex | 6b4f521e5 |
28805767653 has 8 divisors (see below), whose sum is σ = 41362127968. Its totient is φ = 17726626224.
The previous prime is 28805767651. The next prime is 28805767673. The reversal of 28805767653 is 35676750882.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 28805767653 - 21 = 28805767651 is a prime.
It is a super-2 number, since 2×288057676532 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28805767593 and 28805767602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28805767651) 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, 369304675 + ... + 369304752.
It is an arithmetic number, because the mean of its divisors is an integer number (5170265996).
Almost surely, 228805767653 is an apocalyptic number.
It is an amenable number.
28805767653 is a deficient number, since it is larger than the sum of its proper divisors (12556360315).
28805767653 is a wasteful number, since it uses less digits than its factorization.
28805767653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738609443.
The product of its (nonzero) digits is 16934400, while the sum is 57.
The spelling of 28805767653 in words is "twenty-eight billion, eight hundred five million, seven hundred sixty-seven thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •