Search a number
-
+
109011640321 is a prime number
BaseRepresentation
bin110010110000110011…
…0011010000000000001
3101102101012122002210001
41211201212122000001
53241223434442241
6122025041440001
710606260440233
oct1454146320001
9342335562701
10109011640321
1142260257931
1219163940001
13a3838070ac
1453c1c26253
152c80465431
hex196199a001

109011640321 has 2 divisors, whose sum is σ = 109011640322. Its totient is φ = 109011640320.

The previous prime is 109011640319. The next prime is 109011640369. The reversal of 109011640321 is 123046110901.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 83949267600 + 25062372721 = 289740^2 + 158311^2 .

It is a cyclic number.

It is not a de Polignac number, because 109011640321 - 21 = 109011640319 is a prime.

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

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

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

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

Almost surely, 2109011640321 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 28.

The spelling of 109011640321 in words is "one hundred nine billion, eleven million, six hundred forty thousand, three hundred twenty-one".