Search a number
-
+
16565160565141 is a prime number
BaseRepresentation
bin1111000100001110000010…
…0000101101100110010101
32011122121120112002012020121
43301003200200231212111
54132400422101041031
655121532452231541
73326536056402226
oct361034040554625
964577515065217
1016565160565141
1153072773169a1
121a3653290b5b1
1393211b27c8b6
14413a8813124d
151dad70333011
hexf10e082d995

16565160565141 has 2 divisors, whose sum is σ = 16565160565142. Its totient is φ = 16565160565140.

The previous prime is 16565160565133. The next prime is 16565160565171. The reversal of 16565160565141 is 14156506156561.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10905376824241 + 5659783740900 = 3302329^2 + 2379030^2 .

It is a cyclic number.

It is not a de Polignac number, because 16565160565141 - 23 = 16565160565133 is a prime.

It is a congruent number.

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

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

Almost surely, 216565160565141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240000, while the sum is 52.

The spelling of 16565160565141 in words is "sixteen trillion, five hundred sixty-five billion, one hundred sixty million, five hundred sixty-five thousand, one hundred forty-one".