Base | Representation |
---|---|
bin | 11010000111111011… |
… | …001111100010000101 |
3 | 2200101212111202020102 |
4 | 122013323033202011 |
5 | 424421331224203 |
6 | 20515222213445 |
7 | 2012053154666 |
oct | 320773174205 |
9 | 80355452212 |
10 | 28050258053 |
11 | 10994704054 |
12 | 5529b84285 |
13 | 285046673c |
14 | 150151336d |
15 | ae2892888 |
hex | 687ecf885 |
28050258053 has 4 divisors (see below), whose sum is σ = 28307599980. Its totient is φ = 27792916128.
The previous prime is 28050258031. The next prime is 28050258059. The reversal of 28050258053 is 35085205082.
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 7623559969 + 20426698084 = 87313^2 + 142922^2 .
It is a cyclic number.
It is not a de Polignac number, because 28050258053 - 226 = 27983149189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28050257998 and 28050258016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28050258059) 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 3 ways as a sum of consecutive naturals, for example, 128670800 + ... + 128671017.
It is an arithmetic number, because the mean of its divisors is an integer number (7076899995).
Almost surely, 228050258053 is an apocalyptic number.
It is an amenable number.
28050258053 is a deficient number, since it is larger than the sum of its proper divisors (257341927).
28050258053 is a wasteful number, since it uses less digits than its factorization.
28050258053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257341926.
The product of its (nonzero) digits is 96000, while the sum is 38.
The spelling of 28050258053 in words is "twenty-eight billion, fifty million, two hundred fifty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •