Search a number
-
+
51615656001061 is a prime number
BaseRepresentation
bin10111011110001101101001…
…10101110011111000100101
320202202102000210222000002021
423233012310311303320211
523231132330414013221
6301435523252343141
713605052034014135
oct1357066465637045
9222672023860067
1051615656001061
11154a0093216929
125957562914ab1
1322a544906a669
14ca62d52bcac5
155e7995939041
hex2ef1b4d73e25

51615656001061 has 2 divisors, whose sum is σ = 51615656001062. Its totient is φ = 51615656001060.

The previous prime is 51615656001059. The next prime is 51615656001067. The reversal of 51615656001061 is 16010065651615.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 50791135704100 + 824520296961 = 7126790^2 + 908031^2 .

It is a cyclic number.

It is not a de Polignac number, because 51615656001061 - 21 = 51615656001059 is a prime.

Together with 51615656001059, it forms a pair of twin primes.

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

It is a congruent number.

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

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

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

Almost surely, 251615656001061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 162000, while the sum is 43.

The spelling of 51615656001061 in words is "fifty-one trillion, six hundred fifteen billion, six hundred fifty-six million, one thousand, sixty-one".