Search a number
-
+
13895856809 is a prime number
BaseRepresentation
bin11001111000100000…
…11111001010101001
31022212102111122222022
430330100133022221
5211424314404214
610214512234225
71001231556032
oct147420371251
938772448868
1013895856809
11599093798a
12283983b975
131405b775a3
1495b727a89
15564e10d8e
hex33c41f2a9

13895856809 has 2 divisors, whose sum is σ = 13895856810. Its totient is φ = 13895856808.

The previous prime is 13895856773. The next prime is 13895856811. The reversal of 13895856809 is 90865859831.

13895856809 is digitally balanced in base 2, 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., 13895694400 + 162409 = 117880^2 + 403^2 .

It is a cyclic number.

It is not a de Polignac number, because 13895856809 - 224 = 13879079593 is a prime.

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

It is a Chen prime.

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

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

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

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

Almost surely, 213895856809 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 18662400, while the sum is 62.

The spelling of 13895856809 in words is "thirteen billion, eight hundred ninety-five million, eight hundred fifty-six thousand, eight hundred nine".