Base | Representation |
---|---|
bin | 11010111011011110… |
… | …101001001010101101 |
3 | 2202122011000010202111 |
4 | 122323132221022231 |
5 | 433204241113414 |
6 | 21141120324021 |
7 | 2042354640661 |
oct | 327336511255 |
9 | 82564003674 |
10 | 28915176109 |
11 | 11298954866 |
12 | 572b773611 |
13 | 295a6c8c81 |
14 | 158433a8a1 |
15 | b4378e8c4 |
hex | 6bb7a92ad |
28915176109 has 4 divisors (see below), whose sum is σ = 29022667740. Its totient is φ = 28807684480.
The previous prime is 28915176107. The next prime is 28915176113. The reversal of 28915176109 is 90167151982.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10792093225 + 18123082884 = 103885^2 + 134622^2 .
It is a cyclic number.
It is not a de Polignac number, because 28915176109 - 21 = 28915176107 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28915176107) 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, 53745412 + ... + 53745949.
It is an arithmetic number, because the mean of its divisors is an integer number (7255666935).
Almost surely, 228915176109 is an apocalyptic number.
It is an amenable number.
28915176109 is a deficient number, since it is larger than the sum of its proper divisors (107491631).
28915176109 is a wasteful number, since it uses less digits than its factorization.
28915176109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107491630.
The product of its (nonzero) digits is 272160, while the sum is 49.
The spelling of 28915176109 in words is "twenty-eight billion, nine hundred fifteen million, one hundred seventy-six thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •