Search a number
-
+
109933001137 is a prime number
BaseRepresentation
bin110011001100010000…
…1000111100110110001
3101111202102100002012201
41212120201013212301
53300120322014022
6122300313423201
710641146043331
oct1463041074661
9344672302181
10109933001137
1142693349953
121938040ab01
13a49c66c3cb
14546c3430c1
152cd62b1127
hex19988479b1

109933001137 has 2 divisors, whose sum is σ = 109933001138. Its totient is φ = 109933001136.

The previous prime is 109933001119. The next prime is 109933001177. The reversal of 109933001137 is 731100339901.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 65413689121 + 44519312016 = 255761^2 + 210996^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 109933001137 - 235 = 75573262769 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 109933001096 and 109933001105.

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

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

Almost surely, 2109933001137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15309, while the sum is 37.

The spelling of 109933001137 in words is "one hundred nine billion, nine hundred thirty-three million, one thousand, one hundred thirty-seven".