Search a number
-
+
13905709 is a prime number
BaseRepresentation
bin110101000010…
…111100101101
3222011111001021
4311002330231
512024440314
61214014141
7226124266
oct65027455
928144037
1013905709
117938624
1247a7351
132b5b53c
141bbd96d
15134a324
hexd42f2d

13905709 has 2 divisors, whose sum is σ = 13905710. Its totient is φ = 13905708.

The previous prime is 13905707. The next prime is 13905713. The reversal of 13905709 is 90750931.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7171684 + 6734025 = 2678^2 + 2595^2 .

It is a cyclic number.

It is not a de Polignac number, because 13905709 - 21 = 13905707 is a prime.

Together with 13905707, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (13905707) 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, 6952854 + 6952855.

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

Almost surely, 213905709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8505, while the sum is 34.

The square root of 13905709 is about 3729.0359343938. The cubic root of 13905709 is about 240.4719244316.

The spelling of 13905709 in words is "thirteen million, nine hundred five thousand, seven hundred nine".