Search a number
-
+
109474951237 is a prime number
BaseRepresentation
bin110010111110100110…
…1110011000001000101
3101110120111102201212121
41211331031303001011
53243201041414422
6122143032045541
710623614506021
oct1457515630105
9343514381777
10109474951237
1142478835213
1219272b338b1
13a4287b4672
14542758b381
152caae828c7
hex197d373045

109474951237 has 2 divisors, whose sum is σ = 109474951238. Its totient is φ = 109474951236.

The previous prime is 109474951219. The next prime is 109474951273. The reversal of 109474951237 is 732159474901.

Together with next prime (109474951273) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 80502145441 + 28972805796 = 283729^2 + 170214^2 .

It is a cyclic number.

It is not a de Polignac number, because 109474951237 - 235 = 75115212869 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2109474951237 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1905120, while the sum is 52.

The spelling of 109474951237 in words is "one hundred nine billion, four hundred seventy-four million, nine hundred fifty-one thousand, two hundred thirty-seven".