Base | Representation |
---|---|
bin | 101010010001… |
… | …101101010101 |
3 | 202212001102222 |
4 | 222101231111 |
5 | 10314120311 |
6 | 1033312125 |
7 | 163125506 |
oct | 52215525 |
9 | 22761388 |
10 | 11082581 |
11 | 628a564 |
12 | 3865645 |
13 | 23b0553 |
14 | 1686bad |
15 | e8dadb |
hex | a91b55 |
11082581 has 2 divisors, whose sum is σ = 11082582. Its totient is φ = 11082580.
The previous prime is 11082569. The next prime is 11082601. The reversal of 11082581 is 18528011.
11082581 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6916900 + 4165681 = 2630^2 + 2041^2 .
It is a cyclic number.
It is not a de Polignac number, because 11082581 - 26 = 11082517 is a prime.
It is a super-2 number, since 2×110825812 = 245647203243122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11082581.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11082551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5541290 + 5541291.
It is an arithmetic number, because the mean of its divisors is an integer number (5541291).
Almost surely, 211082581 is an apocalyptic number.
It is an amenable number.
11082581 is a deficient number, since it is larger than the sum of its proper divisors (1).
11082581 is an equidigital number, since it uses as much as digits as its factorization.
11082581 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 640, while the sum is 26.
The square root of 11082581 is about 3329.0510659946. The cubic root of 11082581 is about 222.9531630270.
The spelling of 11082581 in words is "eleven million, eighty-two thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •