Search a number
-
+
11305309 is a prime number
BaseRepresentation
bin101011001000…
…000101011101
3210021100222011
4223020011131
510343232214
61042151221
7165044041
oct53100535
923240864
1011305309
116421934
123952511
13245aa42
141704021
15ed4ac4
hexac815d

11305309 has 2 divisors, whose sum is σ = 11305310. Its totient is φ = 11305308.

The previous prime is 11305303. The next prime is 11305321. The reversal of 11305309 is 90350311.

11305309 is digitally balanced in base 3, 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., 11256025 + 49284 = 3355^2 + 222^2 .

It is a cyclic number.

It is not a de Polignac number, because 11305309 - 211 = 11303261 is a prime.

It is equal to p745321 and since 11305309 and 745321 have the same sum of digits, it is a Honaker prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11305309.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11305303) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5652654 + 5652655.

It is an arithmetic number, because the mean of its divisors is an integer number (5652655).

Almost surely, 211305309 is an apocalyptic number.

It is an amenable number.

11305309 is a deficient number, since it is larger than the sum of its proper divisors (1).

11305309 is an equidigital number, since it uses as much as digits as its factorization.

11305309 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 405, while the sum is 22.

The square root of 11305309 is about 3362.3368361900. The cubic root of 11305309 is about 224.4368401847.

The spelling of 11305309 in words is "eleven million, three hundred five thousand, three hundred nine".