Search a number
-
+
151757036836289 is a prime number
BaseRepresentation
bin100010100000010110110000…
…010001011101010111000001
3201220022211102211021002221122
4202200112300101131113001
5124342341402412230124
61254432115325202025
743652040562351403
oct4240266021352701
9656284384232848
10151757036836289
1144399885aa6085
121502b644700315
13668a81cb73b51
142969118c82b73
15128283728675e
hex8a05b045d5c1

151757036836289 has 2 divisors, whose sum is σ = 151757036836290. Its totient is φ = 151757036836288.

The previous prime is 151757036836283. The next prime is 151757036836291. The reversal of 151757036836289 is 982638630757151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 146101201596289 + 5655835240000 = 12087233^2 + 2378200^2 .

It is a cyclic number.

It is not a de Polignac number, because 151757036836289 - 228 = 151756768400833 is a prime.

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

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (151757036836283) 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, 75878518418144 + 75878518418145.

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

Almost surely, 2151757036836289 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 457228800, while the sum is 71.

The spelling of 151757036836289 in words is "one hundred fifty-one trillion, seven hundred fifty-seven billion, thirty-six million, eight hundred thirty-six thousand, two hundred eighty-nine".