Base | Representation |
---|---|
bin | 10000111110110… |
… | …010111001001001 |
3 | 201212002020222212 |
4 | 100332302321021 |
5 | 1040413144331 |
6 | 44134154505 |
7 | 10026404015 |
oct | 2076627111 |
9 | 655066885 |
10 | 284896841 |
11 | 1368a9239 |
12 | 7b4b2a35 |
13 | 47040518 |
14 | 29ba1545 |
15 | 1a028d2b |
hex | 10fb2e49 |
284896841 has 4 divisors (see below), whose sum is σ = 294720900. Its totient is φ = 275072784.
The previous prime is 284896819. The next prime is 284896847. The reversal of 284896841 is 148698482.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 148698482 = 2 ⋅74349241.
It can be written as a sum of positive squares in 2 ways, for example, as 55071241 + 229825600 = 7421^2 + 15160^2 .
It is a cyclic number.
It is not a de Polignac number, because 284896841 - 222 = 280702537 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 284896841.
It is not an unprimeable number, because it can be changed into a prime (284896847) 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, 4911986 + ... + 4912043.
It is an arithmetic number, because the mean of its divisors is an integer number (73680225).
Almost surely, 2284896841 is an apocalyptic number.
It is an amenable number.
284896841 is a deficient number, since it is larger than the sum of its proper divisors (9824059).
284896841 is an equidigital number, since it uses as much as digits as its factorization.
284896841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9824058.
The product of its digits is 884736, while the sum is 50.
The square root of 284896841 is about 16878.8874337143. The cubic root of 284896841 is about 658.0050265535.
The spelling of 284896841 in words is "two hundred eighty-four million, eight hundred ninety-six thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •