Search a number
-
+
100560110550577 is a prime number
BaseRepresentation
bin10110110111010101111001…
…101010101111111000110001
3111012001110020000010121011021
4112313111321222233320301
5101140034101300104302
6553512402123415441
730116141166233326
oct2667257152577061
9435043200117137
10100560110550577
112a050337899a47
12b341281684581
134415a158b9a32
141ab91c7464b4d
15b95bec6e1437
hex5b7579aafe31

100560110550577 has 2 divisors, whose sum is σ = 100560110550578. Its totient is φ = 100560110550576.

The previous prime is 100560110550551. The next prime is 100560110550587. The reversal of 100560110550577 is 775055011065001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 60778380010401 + 39781730540176 = 7796049^2 + 6307276^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-100560110550577 is a prime.

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

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

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

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

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

Almost surely, 2100560110550577 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 183750, while the sum is 43.

The spelling of 100560110550577 in words is "one hundred trillion, five hundred sixty billion, one hundred ten million, five hundred fifty thousand, five hundred seventy-seven".