Search a number
-
+
25057211065361 is a prime number
BaseRepresentation
bin1011011001010000101100…
…01010100010010000010001
310021201110001010021212201122
411230220112022202100101
511241014132013042421
6125143042430212025
75164216022561006
oct554502612422021
9107643033255648
1025057211065361
117a907814517a2
122988309354015
1310c9b670806a7
14628abdd138ad
152d6be00592ab
hex16ca162a2411

25057211065361 has 2 divisors, whose sum is σ = 25057211065362. Its totient is φ = 25057211065360.

The previous prime is 25057211065357. The next prime is 25057211065379. The reversal of 25057211065361 is 16356011275052.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 24733712890000 + 323498175361 = 4973300^2 + 568769^2 .

It is a cyclic number.

It is not a de Polignac number, because 25057211065361 - 22 = 25057211065357 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 225057211065361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 378000, while the sum is 44.

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