Search a number
-
+
151111530501377 is a prime number
BaseRepresentation
bin100010010110111101100101…
…000110001101010100000001
3201211001010021101012201110212
4202112331211012031110001
5124301302403302021002
61253215402340203505
743554306411135125
oct4226754506152401
9654033241181425
10151111530501377
1144170049553636
1214b46515999595
1366419aa442b64
142945ba1009585
151270b57310352
hex896f6518d501

151111530501377 has 2 divisors, whose sum is σ = 151111530501378. Its totient is φ = 151111530501376.

The previous prime is 151111530501343. The next prime is 151111530501497. The reversal of 151111530501377 is 773105035111151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 114844143839296 + 36267386662081 = 10716536^2 + 6022241^2 .

It is a cyclic number.

It is not a de Polignac number, because 151111530501377 - 212 = 151111530497281 is a prime.

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

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

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

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

Almost surely, 2151111530501377 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 55125, while the sum is 41.

The spelling of 151111530501377 in words is "one hundred fifty-one trillion, one hundred eleven billion, five hundred thirty million, five hundred one thousand, three hundred seventy-seven".