Search a number
-
+
169105967857 is a prime number
BaseRepresentation
bin1001110101111110000…
…0000100101011110001
3121011111021201020120201
42131133200010223301
510232312111432412
6205404115435201
715134414003311
oct2353740045361
9534437636521
10169105967857
1165798a01632
12289352b5b01
1312c3c96cb98
148283031441
1545eb0ebe57
hex275f804af1

169105967857 has 2 divisors, whose sum is σ = 169105967858. Its totient is φ = 169105967856.

The previous prime is 169105967753. The next prime is 169105967887. The reversal of 169105967857 is 758769501961.

169105967857 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 130805912241 + 38300055616 = 361671^2 + 195704^2 .

It is a cyclic number.

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

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

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

Almost surely, 2169105967857 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28576800, while the sum is 64.

The spelling of 169105967857 in words is "one hundred sixty-nine billion, one hundred five million, nine hundred sixty-seven thousand, eight hundred fifty-seven".