Base | Representation |
---|---|
bin | 101010000111… |
… | …100101111001 |
3 | 202202221121022 |
4 | 222013211321 |
5 | 10311304040 |
6 | 1032352225 |
7 | 162563633 |
oct | 52074571 |
9 | 22687538 |
10 | 11041145 |
11 | 6261415 |
12 | 3845675 |
13 | 239772b |
14 | 1675a53 |
15 | e816b5 |
hex | a87979 |
11041145 has 4 divisors (see below), whose sum is σ = 13249380. Its totient is φ = 8832912.
The previous prime is 11041111. The next prime is 11041157. The reversal of 11041145 is 54114011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54114011 = 7 ⋅7730573.
It can be written as a sum of positive squares in 2 ways, for example, as 6801664 + 4239481 = 2608^2 + 2059^2 .
It is a cyclic number.
It is not a de Polignac number, because 11041145 - 216 = 10975609 is a prime.
It is a super-2 number, since 2×110411452 = 243813765822050, which contains 22 as substring.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 1104110 + ... + 1104119.
It is an arithmetic number, because the mean of its divisors is an integer number (3312345).
Almost surely, 211041145 is an apocalyptic number.
It is an amenable number.
11041145 is a deficient number, since it is larger than the sum of its proper divisors (2208235).
11041145 is an equidigital number, since it uses as much as digits as its factorization.
11041145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2208234.
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 11041145 is about 3322.8218429522. The cubic root of 11041145 is about 222.6749539248.
Adding to 11041145 its reverse (54114011), we get a palindrome (65155156).
The spelling of 11041145 in words is "eleven million, forty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •