Base | Representation |
---|---|
bin | 101011011011… |
… | …100001001101 |
3 | 210102102011022 |
4 | 223123201031 |
5 | 10403304114 |
6 | 1044003525 |
7 | 165525104 |
oct | 53334115 |
9 | 23372138 |
10 | 11384909 |
11 | 6476718 |
12 | 39905a5 |
13 | 2488043 |
14 | 172503b |
15 | eed48e |
hex | adb84d |
11384909 has 2 divisors, whose sum is σ = 11384910. Its totient is φ = 11384908.
The previous prime is 11384903. The next prime is 11384911. The reversal of 11384909 is 90948311.
11384909 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11222500 + 162409 = 3350^2 + 403^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11384909 is a prime.
It is a Sophie Germain prime.
Together with 11384911, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11384903) 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, 5692454 + 5692455.
It is an arithmetic number, because the mean of its divisors is an integer number (5692455).
Almost surely, 211384909 is an apocalyptic number.
It is an amenable number.
11384909 is a deficient number, since it is larger than the sum of its proper divisors (1).
11384909 is an equidigital number, since it uses as much as digits as its factorization.
11384909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 35.
The square root of 11384909 is about 3374.1530789222. The cubic root of 11384909 is about 224.9623574888.
The spelling of 11384909 in words is "eleven million, three hundred eighty-four thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •