Search a number
-
+
109514040415937 is a prime number
BaseRepresentation
bin11000111001101000111001…
…011110100001011011000001
3112100202102212202212002200122
4120321220321132201123001
5103323234223321302222
61024530020003230025
732032062004305353
oct3071507136413301
9470672782762618
10109514040415937
1131992709876033
121034867a678315
13491518bc43511
141d087177150d3
15c9daa1547a42
hex639a397a16c1

109514040415937 has 2 divisors, whose sum is σ = 109514040415938. Its totient is φ = 109514040415936.

The previous prime is 109514040415841. The next prime is 109514040415963. The reversal of 109514040415937 is 739514040415901.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 58576001022016 + 50938039393921 = 7653496^2 + 7137089^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2109514040415937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2721600, while the sum is 53.

The spelling of 109514040415937 in words is "one hundred nine trillion, five hundred fourteen billion, forty million, four hundred fifteen thousand, nine hundred thirty-seven".