Search a number
-
+
1055040866861 is a prime number
BaseRepresentation
bin11110101101001010101…
…01100000101000101101
310201212020121112011110112
433112211111200220231
5114241210430214421
62124402403145405
7136136616254432
oct17264525405055
93655217464415
101055040866861
11377493078913
12150583075265
137864a4a5407
14390c8435b89
151c69d93645b
hexf5a5560a2d

1055040866861 has 2 divisors, whose sum is σ = 1055040866862. Its totient is φ = 1055040866860.

The previous prime is 1055040866843. The next prime is 1055040866899. The reversal of 1055040866861 is 1686680405501.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 529678284100 + 525362582761 = 727790^2 + 724819^2 .

It is a cyclic number.

It is not a de Polignac number, because 1055040866861 - 214 = 1055040850477 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 21055040866861 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1382400, while the sum is 50.

The spelling of 1055040866861 in words is "one trillion, fifty-five billion, forty million, eight hundred sixty-six thousand, eight hundred sixty-one".