Base | Representation |
---|---|
bin | 101010010110… |
… | …111100010101 |
3 | 202220010212001 |
4 | 222112330111 |
5 | 10320312041 |
6 | 1033555301 |
7 | 163245145 |
oct | 52267425 |
9 | 22803761 |
10 | 11104021 |
11 | 62a4685 |
12 | 3875b31 |
13 | 23ba236 |
14 | 1690925 |
15 | e95131 |
hex | a96f15 |
11104021 has 2 divisors, whose sum is σ = 11104022. Its totient is φ = 11104020.
The previous prime is 11104007. The next prime is 11104031. The reversal of 11104021 is 12040111.
It is an a-pointer prime, because the next prime (11104031) can be obtained adding 11104021 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8820900 + 2283121 = 2970^2 + 1511^2 .
It is a cyclic number.
It is not a de Polignac number, because 11104021 - 29 = 11103509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11103989 and 11104007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11104031) 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 as a sum of consecutive naturals, namely, 5552010 + 5552011.
It is an arithmetic number, because the mean of its divisors is an integer number (5552011).
Almost surely, 211104021 is an apocalyptic number.
It is an amenable number.
11104021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11104021 is an equidigital number, since it uses as much as digits as its factorization.
11104021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 11104021 is about 3332.2696469524. The cubic root of 11104021 is about 223.0968430548.
Adding to 11104021 its reverse (12040111), we get a palindrome (23144132).
The spelling of 11104021 in words is "eleven million, one hundred four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •