Search a number
-
+
163095611477 is a prime number
BaseRepresentation
bin1001011111100101000…
…0011000100001010101
3120120222102011111121212
42113321100120201111
510133004434031402
6202531452551205
714532442552361
oct2277120304125
9516872144555
10163095611477
1163194247957
1227738482505
13124c26b92a6
147c72ac82a1
15439861a952
hex25f9418855

163095611477 has 2 divisors, whose sum is σ = 163095611478. Its totient is φ = 163095611476.

The previous prime is 163095611387. The next prime is 163095611479. The reversal of 163095611477 is 774116590361.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 111479860996 + 51615750481 = 333886^2 + 227191^2 .

It is an emirp because it is prime and its reverse (774116590361) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 163095611477 - 216 = 163095545941 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 2163095611477 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 952560, while the sum is 50.

The spelling of 163095611477 in words is "one hundred sixty-three billion, ninety-five million, six hundred eleven thousand, four hundred seventy-seven".