Search a number
-
+
1055111201561 is a prime number
BaseRepresentation
bin11110101101010011000…
…01110100001100011001
310201212102111212112112102
433112221201310030121
5114241331431422221
62124413354453145
7136141432144034
oct17265141641431
93655374775472
101055111201561
1137751984836a
121505a27341b5
137865bc30391
14390d390401b
151c6a4bcb30b
hexf5a9874319

1055111201561 has 2 divisors, whose sum is σ = 1055111201562. Its totient is φ = 1055111201560.

The previous prime is 1055111201513. The next prime is 1055111201567. The reversal of 1055111201561 is 1651021115501.

1055111201561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 685988123536 + 369123078025 = 828244^2 + 607555^2 .

It is a cyclic number.

It is not a de Polignac number, because 1055111201561 - 218 = 1055110939417 is a prime.

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

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

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

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

Almost surely, 21055111201561 is an apocalyptic number.

It is an amenable number.

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

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

1055111201561 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1500, while the sum is 29.

The spelling of 1055111201561 in words is "one trillion, fifty-five billion, one hundred eleven million, two hundred one thousand, five hundred sixty-one".