Base | Representation |
---|---|
bin | 10000110101100… |
… | …001111011010101 |
3 | 201200111212022202 |
4 | 100311201323111 |
5 | 1034302434203 |
6 | 44010134245 |
7 | 6666640010 |
oct | 2065417325 |
9 | 650455282 |
10 | 282468053 |
11 | 13549a47a |
12 | 7a721385 |
13 | 4669cb7a |
14 | 2972c377 |
15 | 19be9388 |
hex | 10d61ed5 |
282468053 has 4 divisors (see below), whose sum is σ = 322820640. Its totient is φ = 242115468.
The previous prime is 282468029. The next prime is 282468059. The reversal of 282468053 is 350864282.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 282468053 - 214 = 282451669 is a prime.
It is a super-3 number, since 3×2824680533 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 282467998 and 282468016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (282468059) 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, 20176283 + ... + 20176296.
It is an arithmetic number, because the mean of its divisors is an integer number (80705160).
Almost surely, 2282468053 is an apocalyptic number.
It is an amenable number.
282468053 is a deficient number, since it is larger than the sum of its proper divisors (40352587).
282468053 is an equidigital number, since it uses as much as digits as its factorization.
282468053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40352586.
The product of its (nonzero) digits is 92160, while the sum is 38.
The square root of 282468053 is about 16806.7859211689. The cubic root of 282468053 is about 656.1298240047.
The spelling of 282468053 in words is "two hundred eighty-two million, four hundred sixty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •