Base | Representation |
---|---|
bin | 11010000111000100… |
… | …110110100001111001 |
3 | 2200100212200100200101 |
4 | 122013010312201321 |
5 | 424404203443430 |
6 | 20513552435401 |
7 | 2011521031636 |
oct | 320704664171 |
9 | 80325610611 |
10 | 28035999865 |
11 | 10987655725 |
12 | 5525248b61 |
13 | 284a513943 |
14 | 14dd68118d |
15 | ae14c7dca |
hex | 687136879 |
28035999865 has 4 divisors (see below), whose sum is σ = 33643199844. Its totient is φ = 22428799888.
The previous prime is 28035999851. The next prime is 28035999869. The reversal of 28035999865 is 56899953082.
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 4613533929 + 23422465936 = 67923^2 + 153044^2 .
It is a cyclic number.
It is not a de Polignac number, because 28035999865 - 25 = 28035999833 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28035999797 and 28035999806.
It is not an unprimeable number, because it can be changed into a prime (28035999869) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2803599982 + ... + 2803599991.
It is an arithmetic number, because the mean of its divisors is an integer number (8410799961).
Almost surely, 228035999865 is an apocalyptic number.
It is an amenable number.
28035999865 is a deficient number, since it is larger than the sum of its proper divisors (5607199979).
28035999865 is an equidigital number, since it uses as much as digits as its factorization.
28035999865 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5607199978.
The product of its (nonzero) digits is 41990400, while the sum is 64.
The spelling of 28035999865 in words is "twenty-eight billion, thirty-five million, nine hundred ninety-nine thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •