Search a number
-
+
16105561576579 is a prime number
BaseRepresentation
bin1110101001011101111001…
…0001101101010010000011
32010000200021021111111210001
43222113132101231102003
54102333142230422304
654130443131020431
73251405554430116
oct352273621552203
963020237444701
1016105561576579
11514a36a703352
121981447b9a717
138ca9952bb167
143d972886457d
151cde214e9da4
hexea5de46d483

16105561576579 has 2 divisors, whose sum is σ = 16105561576580. Its totient is φ = 16105561576578.

The previous prime is 16105561576523. The next prime is 16105561576607. The reversal of 16105561576579 is 97567516550161.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 16105561576579 - 233 = 16096971641987 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 16105561576579.

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

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

Almost surely, 216105561576579 is an apocalyptic number.

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

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

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

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

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