Search a number
-
+
109663634027 is a prime number
BaseRepresentation
bin110011000100001110…
…1100100001001101011
3101111001122110211000002
41212020131210021223
53244042342242102
6122213452133215
710631365336433
oct1461035441153
9344048424002
10109663634027
1142565298402
121930616720b
13a45890869c
1454446652c3
152cbc803902
hex198876426b

109663634027 has 2 divisors, whose sum is σ = 109663634028. Its totient is φ = 109663634026.

The previous prime is 109663633991. The next prime is 109663634029. The reversal of 109663634027 is 720436366901.

It is a strong prime.

It is an emirp because it is prime and its reverse (720436366901) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 109663634027 - 212 = 109663629931 is a prime.

It is a super-2 number, since 2×1096636340272 (a number of 23 digits) contains 22 as substring.

Together with 109663634029, 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 (109663634029) 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, 54831817013 + 54831817014.

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

Almost surely, 2109663634027 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 979776, while the sum is 47.

The spelling of 109663634027 in words is "one hundred nine billion, six hundred sixty-three million, six hundred thirty-four thousand, twenty-seven".