Search a number
-
+
151402615369 is a prime number
BaseRepresentation
bin1000110100000001001…
…1001001001001001001
3112110210111201202102221
42031000103021021021
54440033032142434
6153315311254041
713636616665615
oct2150023111111
9473714652387
10151402615369
1159233913905
122541451a321
131137b035495
147483b84345
153e11cde2b4
hex23404c9249

151402615369 has 2 divisors, whose sum is σ = 151402615370. Its totient is φ = 151402615368.

The previous prime is 151402615339. The next prime is 151402615373. The reversal of 151402615369 is 963516204151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 78505315344 + 72897300025 = 280188^2 + 269995^2 .

It is a cyclic number.

It is not a de Polignac number, because 151402615369 - 25 = 151402615337 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2151402615369 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 151402615369 in words is "one hundred fifty-one billion, four hundred two million, six hundred fifteen thousand, three hundred sixty-nine".