Search a number
-
+
9166159401713 is a prime number
BaseRepresentation
bin1000010101100010100110…
…1011001101001011110001
31012110021110102001000001122
42011120221223031023301
52200134243301323323
631254513035112025
71634142655244666
oct205305153151361
935407412030048
109166159401713
112a1438a025a26
1210405682a2615
135164992366c2
1423990465da6d
1510d675c8bec8
hex85629acd2f1

9166159401713 has 2 divisors, whose sum is σ = 9166159401714. Its totient is φ = 9166159401712.

The previous prime is 9166159401577. The next prime is 9166159401719. The reversal of 9166159401713 is 3171049516619.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7950273862129 + 1215885539584 = 2819623^2 + 1102672^2 .

It is a cyclic number.

It is not a de Polignac number, because 9166159401713 - 214 = 9166159385329 is a prime.

It is a super-2 number, since 2×91661594017132 (a number of 27 digits) contains 22 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 (9166159401719) by changing a digit.

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

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

Almost surely, 29166159401713 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 9166159401713 in words is "nine trillion, one hundred sixty-six billion, one hundred fifty-nine million, four hundred one thousand, seven hundred thirteen".