Search a number
-
+
151413361669 is a prime number
BaseRepresentation
bin1000110100000011110…
…0001000110000000101
3112110211020221201121001
42031000330020300011
54440043310033134
6153320333453301
713640110224133
oct2150074106005
9473736851531
10151413361669
1159239993749
1225418041231
131138032893b
147485380753
153e12c13414
hex2340f08c05

151413361669 has 2 divisors, whose sum is σ = 151413361670. Its totient is φ = 151413361668.

The previous prime is 151413361663. The next prime is 151413361709. The reversal of 151413361669 is 966163314151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 126211799169 + 25201562500 = 355263^2 + 158750^2 .

It is a cyclic number.

It is not a de Polignac number, because 151413361669 - 29 = 151413361157 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2151413361669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 349920, while the sum is 46.

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