Search a number
-
+
151515156016051 is a prime number
BaseRepresentation
bin100010011100110101011111…
…000011010110101110110011
3201212110201002201211022121221
4202130311133003112232303
5124324411014420003201
61254125033551525511
743625415545325562
oct4234653703265663
9655421081738557
10151515156016051
1144306242640853
1214bb079b229897
136670a82c25849
14295b5308bdbd9
15127b3cc15a4a1
hex89cd5f0d6bb3

151515156016051 has 2 divisors, whose sum is σ = 151515156016052. Its totient is φ = 151515156016050.

The previous prime is 151515156016019. The next prime is 151515156016111. The reversal of 151515156016051 is 150610651515151.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 151515156016051 - 25 = 151515156016019 is a prime.

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

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

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

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

Almost surely, 2151515156016051 is an apocalyptic number.

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

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

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

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

The spelling of 151515156016051 in words is "one hundred fifty-one trillion, five hundred fifteen billion, one hundred fifty-six million, sixteen thousand, fifty-one".