Search a number
-
+
16366347405557 is a prime number
BaseRepresentation
bin1110111000101001011001…
…0100101100100011110101
32010221121101220001020201122
43232022112110230203311
54121121234413434212
654450332440233325
73306300226414322
oct356122624544365
963847356036648
1016366347405557
11523aa24493546
121a03aa876b845
13919455ac8176
144081c7915b49
151d5ad619a272
hexee29652c8f5

16366347405557 has 2 divisors, whose sum is σ = 16366347405558. Its totient is φ = 16366347405556.

The previous prime is 16366347405539. The next prime is 16366347405599. The reversal of 16366347405557 is 75550474366361.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 15866846189041 + 499501216516 = 3983321^2 + 706754^2 .

It is a cyclic number.

It is not a de Polignac number, because 16366347405557 - 26 = 16366347405493 is a prime.

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

It is a congruent number.

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

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

Almost surely, 216366347405557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 190512000, while the sum is 62.

The spelling of 16366347405557 in words is "sixteen trillion, three hundred sixty-six billion, three hundred forty-seven million, four hundred five thousand, five hundred fifty-seven".