Search a number
-
+
51684163059157 is a prime number
BaseRepresentation
bin10111100000001101010000…
…01011011111110111010101
320202222221212012002010200021
423300012220023133313111
523233243131220343112
6301531213212345141
713613025512263366
oct1360065013376725
9222887765063607
1051684163059157
1115517148709612
1259688a17751b1
1322aba460c4525
14ca975390bb6d
155e9654e46907
hex2f01a82dfdd5

51684163059157 has 2 divisors, whose sum is σ = 51684163059158. Its totient is φ = 51684163059156.

The previous prime is 51684163059143. The next prime is 51684163059173. The reversal of 51684163059157 is 75195036148615.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 48725439690321 + 2958723368836 = 6980361^2 + 1720094^2 .

It is a cyclic number.

It is not a de Polignac number, because 51684163059157 - 27 = 51684163059029 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 251684163059157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27216000, while the sum is 61.

The spelling of 51684163059157 in words is "fifty-one trillion, six hundred eighty-four billion, one hundred sixty-three million, fifty-nine thousand, one hundred fifty-seven".