Base | Representation |
---|---|
bin | 101011000010… |
… | …011010100101 |
3 | 210020012010000 |
4 | 223002122211 |
5 | 10342011320 |
6 | 1041451513 |
7 | 164616243 |
oct | 53023245 |
9 | 23205100 |
10 | 11282085 |
11 | 6406441 |
12 | 3940b99 |
13 | 24502b9 |
14 | 16d9793 |
15 | eccc90 |
hex | ac26a5 |
11282085 has 40 divisors (see below), whose sum is σ = 20516760. Its totient is φ = 5930496.
The previous prime is 11282083. The next prime is 11282099. The reversal of 11282085 is 58028211.
It can be written as a sum of positive squares in 4 ways, for example, as 431649 + 10850436 = 657^2 + 3294^2 .
It is not a de Polignac number, because 11282085 - 21 = 11282083 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nialpdrome in base 15.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11282083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 35889 + ... + 36201.
It is an arithmetic number, because the mean of its divisors is an integer number (512919).
Almost surely, 211282085 is an apocalyptic number.
11282085 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11282085 is a deficient number, since it is larger than the sum of its proper divisors (9234675).
11282085 is an equidigital number, since it uses as much as digits as its factorization.
11282085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419 (or 410 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 27.
The square root of 11282085 is about 3358.8815102650. The cubic root of 11282085 is about 224.2830512464.
The spelling of 11282085 in words is "eleven million, two hundred eighty-two thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •