Search a number
-
+
53032102129 is a prime number
BaseRepresentation
bin110001011000111101…
…011010100011110001
312001212220020220210201
4301120331122203301
51332102204232004
640210153555201
73555120300436
oct613075324361
9161786226721
1053032102129
112054426a286
12a340415b01
135001cb3cb6
1427d12d1b8d
1515a5b7a6a4
hexc58f5a8f1

53032102129 has 2 divisors, whose sum is σ = 53032102130. Its totient is φ = 53032102128.

The previous prime is 53032102099. The next prime is 53032102159. The reversal of 53032102129 is 92120123035.

It is a balanced prime because it is at equal distance from previous prime (53032102099) and next prime (53032102159).

It can be written as a sum of positive squares in only one way, i.e., 52221390400 + 810711729 = 228520^2 + 28473^2 .

It is a cyclic number.

It is not a de Polignac number, because 53032102129 - 27 = 53032102001 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 53032102097 and 53032102106.

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

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

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

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

Almost surely, 253032102129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 28.

The spelling of 53032102129 in words is "fifty-three billion, thirty-two million, one hundred two thousand, one hundred twenty-nine".