Search a number
-
+
129161520255641 is a prime number
BaseRepresentation
bin11101010111100011000010…
…100010001001001010011001
3121221022201110102102222222012
4131113203002202021022121
5113412140243141140031
61134411552215035305
736130416610366016
oct3527430242111231
9557281412388865
10129161520255641
1138178102a50015
12125a044b96bb35
13570bb574bb113
1423c764552270d
15edebc2ebab2b
hex7578c2889299

129161520255641 has 2 divisors, whose sum is σ = 129161520255642. Its totient is φ = 129161520255640.

The previous prime is 129161520255613. The next prime is 129161520255661. The reversal of 129161520255641 is 146552025161921.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 129161520255625 + 16 = 11364925^2 + 4^2 .

It is a cyclic number.

It is not a de Polignac number, because 129161520255641 - 218 = 129161519993497 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 129161520255641.

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

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

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

Almost surely, 2129161520255641 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 129161520255641 in words is "one hundred twenty-nine trillion, one hundred sixty-one billion, five hundred twenty million, two hundred fifty-five thousand, six hundred forty-one".