Base | Representation |
---|---|
bin | 101011100001… |
… | …011101011001 |
3 | 210110122112111 |
4 | 223201131121 |
5 | 10410043431 |
6 | 1044312321 |
7 | 165656044 |
oct | 53413531 |
9 | 23418474 |
10 | 11409241 |
11 | 6492a28 |
12 | 39a26a1 |
13 | 249613c |
14 | 172dc5b |
15 | 10057b1 |
hex | ae1759 |
11409241 has 4 divisors (see below), whose sum is σ = 11423412. Its totient is φ = 11395072.
The previous prime is 11409221. The next prime is 11409287. The reversal of 11409241 is 14290411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14290411 = 31 ⋅460981.
It can be written as a sum of positive squares in 2 ways, for example, as 7722841 + 3686400 = 2779^2 + 1920^2 .
It is a cyclic number.
It is not a de Polignac number, because 11409241 - 27 = 11409113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11409221) by changing a digit.
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, 5800 + ... + 7513.
It is an arithmetic number, because the mean of its divisors is an integer number (2855853).
Almost surely, 211409241 is an apocalyptic number.
It is an amenable number.
11409241 is a deficient number, since it is larger than the sum of its proper divisors (14171).
11409241 is an equidigital number, since it uses as much as digits as its factorization.
11409241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14170.
The product of its (nonzero) digits is 288, while the sum is 22.
The square root of 11409241 is about 3377.7568000080. The cubic root of 11409241 is about 225.1225077706.
Adding to 11409241 its reverse (14290411), we get a palindrome (25699652).
The spelling of 11409241 in words is "eleven million, four hundred nine thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •