Search a number
-
+
159691037249 is a prime number
BaseRepresentation
bin1001010010111001010…
…0111101101001000001
3120021012010212012210002
42110232110331221001
510104021401142444
6201205553045345
714352202264112
oct2245624755101
9507163765702
10159691037249
11617a7477947
1226b48256855
131209c251423
147a2c88a209
1542497acd4e
hex252e53da41

159691037249 has 2 divisors, whose sum is σ = 159691037250. Its totient is φ = 159691037248.

The previous prime is 159691037203. The next prime is 159691037251. The reversal of 159691037249 is 942730196951.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 114645219649 + 45045817600 = 338593^2 + 212240^2 .

It is a cyclic number.

It is not a de Polignac number, because 159691037249 - 28 = 159691036993 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2159691037249 is an apocalyptic number.

It is an amenable number.

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

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

159691037249 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 3674160, while the sum is 56.

The spelling of 159691037249 in words is "one hundred fifty-nine billion, six hundred ninety-one million, thirty-seven thousand, two hundred forty-nine".