Base | Representation |
---|---|
bin | 10000110101010… |
… | …110001101001001 |
3 | 201200102102110112 |
4 | 100311112031021 |
5 | 1034244420131 |
6 | 44005124105 |
7 | 6666350021 |
oct | 2065261511 |
9 | 650372415 |
10 | 282420041 |
11 | 1354673a2 |
12 | 7a6b9635 |
13 | 46684067 |
14 | 29718a81 |
15 | 19bda02b |
hex | 10d56349 |
282420041 has 2 divisors, whose sum is σ = 282420042. Its totient is φ = 282420040.
The previous prime is 282419959. The next prime is 282420053. The reversal of 282420041 is 140024282.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 169104016 + 113316025 = 13004^2 + 10645^2 .
It is a cyclic number.
It is not a de Polignac number, because 282420041 - 222 = 278225737 is a prime.
It is a super-2 number, since 2×2824200412 = 159522159116883362, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 282419989 and 282420016.
It is not a weakly prime, because it can be changed into another prime (282420071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 141210020 + 141210021.
It is an arithmetic number, because the mean of its divisors is an integer number (141210021).
Almost surely, 2282420041 is an apocalyptic number.
It is an amenable number.
282420041 is a deficient number, since it is larger than the sum of its proper divisors (1).
282420041 is an equidigital number, since it uses as much as digits as its factorization.
282420041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1024, while the sum is 23.
The square root of 282420041 is about 16805.3575088422. The cubic root of 282420041 is about 656.0926470687.
The spelling of 282420041 in words is "two hundred eighty-two million, four hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •