Search a number
-
+
151665110557 is a prime number
BaseRepresentation
bin1000110100111111110…
…0011110111000011101
3112111110210122220010221
42031033330132320131
54441102232014212
6153401325401341
713646255111662
oct2151774367035
9474423586127
10151665110557
1159359001384
1225488409251
13113c053138c
1474aa993a69
153e29d90807
hex234ff1ee1d

151665110557 has 2 divisors, whose sum is σ = 151665110558. Its totient is φ = 151665110556.

The previous prime is 151665110537. The next prime is 151665110561. The reversal of 151665110557 is 755011566151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 147718004281 + 3947106276 = 384341^2 + 62826^2 .

It is an emirp because it is prime and its reverse (755011566151) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 151665110557 - 215 = 151665077789 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2151665110557 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 151665110557 in words is "one hundred fifty-one billion, six hundred sixty-five million, one hundred ten thousand, five hundred fifty-seven".