Search a number
-
+
16143663305569 is a prime number
BaseRepresentation
bin1110101011101011110101…
…0100010001001101100001
32010011022121122121212222211
43222322331110101031201
54103444210301234234
654200144015202121
73254225011662112
oct352727524211541
963138548555884
1016143663305569
115164542087278
121988900216341
13901457cc3b27
143db500c98209
151cee01516164
hexeaebd511361

16143663305569 has 2 divisors, whose sum is σ = 16143663305570. Its totient is φ = 16143663305568.

The previous prime is 16143663305537. The next prime is 16143663305579. The reversal of 16143663305569 is 96550336634161.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 15550308918544 + 593354387025 = 3943388^2 + 770295^2 .

It is a cyclic number.

It is not a de Polignac number, because 16143663305569 - 25 = 16143663305537 is a prime.

It is a super-2 number, since 2×161436633055692 (a number of 27 digits) contains 22 as substring.

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

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

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

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

Almost surely, 216143663305569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31492800, while the sum is 58.

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