Search a number
-
+
107734067393 is a prime number
BaseRepresentation
bin110010001010101110…
…0110110100011000001
3101022002011122200012012
41210111130312203001
53231114410124033
6121254202542305
710532515314641
oct1442534664301
9338064580165
10107734067393
1141765088437
1218a67b07995
13a20bc22194
1453002a2521
152c08205248
hex19157368c1

107734067393 has 2 divisors, whose sum is σ = 107734067394. Its totient is φ = 107734067392.

The previous prime is 107734067381. The next prime is 107734067417. The reversal of 107734067393 is 393760437701.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 104375517184 + 3358550209 = 323072^2 + 57953^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-107734067393 is a prime.

It is a super-3 number, since 3×1077340673933 (a number of 34 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2107734067393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2000376, while the sum is 50.

The spelling of 107734067393 in words is "one hundred seven billion, seven hundred thirty-four million, sixty-seven thousand, three hundred ninety-three".