Base | Representation |
---|---|
bin | 101011000011… |
… | …001001011001 |
3 | 210020100012222 |
4 | 223003021121 |
5 | 10342110311 |
6 | 1041513425 |
7 | 164631053 |
oct | 53031131 |
9 | 23210188 |
10 | 11285081 |
11 | 6408715 |
12 | 3942875 |
13 | 2451782 |
14 | 16da8d3 |
15 | ecdadb |
hex | ac3259 |
11285081 has 2 divisors, whose sum is σ = 11285082. Its totient is φ = 11285080.
The previous prime is 11285063. The next prime is 11285083. The reversal of 11285081 is 18058211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5953600 + 5331481 = 2440^2 + 2309^2 .
It is a cyclic number.
It is not a de Polignac number, because 11285081 - 26 = 11285017 is a prime.
It is a super-2 number, since 2×112850812 = 254706106353122, which contains 22 as substring.
Together with 11285083, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11285081.
It is not a weakly prime, because it can be changed into another prime (11285083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5642540 + 5642541.
It is an arithmetic number, because the mean of its divisors is an integer number (5642541).
Almost surely, 211285081 is an apocalyptic number.
It is an amenable number.
11285081 is a deficient number, since it is larger than the sum of its proper divisors (1).
11285081 is an equidigital number, since it uses as much as digits as its factorization.
11285081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 640, while the sum is 26.
The square root of 11285081 is about 3359.3274624544. The cubic root of 11285081 is about 224.3029025579.
The spelling of 11285081 in words is "eleven million, two hundred eighty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •