Search a number
-
+
487837150961 is a prime number
BaseRepresentation
bin1110001100101010101…
…11000010111011110001
31201122012012122222000012
413012111113002323301
530443042302312321
61012035335104305
750150026236146
oct7062527027361
91648165588005
10487837150961
11178988398a46
127a667812095
1337006338a94
141987bb343cd
15ca52e4605b
hex71955c2ef1

487837150961 has 2 divisors, whose sum is σ = 487837150962. Its totient is φ = 487837150960.

The previous prime is 487837150891. The next prime is 487837150981. The reversal of 487837150961 is 169051738784.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 483052800400 + 4784350561 = 695020^2 + 69169^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-487837150961 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 487837150961.

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

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

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

Almost surely, 2487837150961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10160640, while the sum is 59.

The spelling of 487837150961 in words is "four hundred eighty-seven billion, eight hundred thirty-seven million, one hundred fifty thousand, nine hundred sixty-one".