Search a number
-
+
151020143667257 is a prime number
BaseRepresentation
bin100010010101101000011110…
…000001000110100000111001
3201210201101101110202112120212
4202111220132001012200321
5124243303223234323012
61253105410215200505
743544562641642324
oct4225503601064071
9653641343675525
10151020143667257
1144135313016547
1214b30870676135
1366361a5201997
1429415b1c657bb
15126d5a933eb22
hex895a1e046839

151020143667257 has 2 divisors, whose sum is σ = 151020143667258. Its totient is φ = 151020143667256.

The previous prime is 151020143667223. The next prime is 151020143667269. The reversal of 151020143667257 is 752766341020151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 150435842422441 + 584301244816 = 12265229^2 + 764396^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-151020143667257 is a prime.

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

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

Almost surely, 2151020143667257 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 151020143667257 in words is "one hundred fifty-one trillion, twenty billion, one hundred forty-three million, six hundred sixty-seven thousand, two hundred fifty-seven".