Search a number
-
+
1057271621981 is a prime number
BaseRepresentation
bin11110110001010100100…
…11001010100101011101
310202002000002002021012112
433120222103022211131
5114310243013400411
62125412012043405
7136246114335611
oct17305223124535
93662002067175
101057271621981
113784282a4193
12150aa6163565
13789146b4663
143925a7db341
151c77e6cab8b
hexf62a4ca95d

1057271621981 has 2 divisors, whose sum is σ = 1057271621982. Its totient is φ = 1057271621980.

The previous prime is 1057271621909. The next prime is 1057271622019. The reversal of 1057271621981 is 1891261727501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 693457573081 + 363814048900 = 832741^2 + 603170^2 .

It is a cyclic number.

It is not a de Polignac number, because 1057271621981 - 222 = 1057267427677 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21057271621981 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1057271621981 in words is "one trillion, fifty-seven billion, two hundred seventy-one million, six hundred twenty-one thousand, nine hundred eighty-one".