Search a number
-
+
487261953097 is a prime number
BaseRepresentation
bin1110001011100110001…
…00110101110001001001
31201120201010022212212121
413011303010311301021
530440403024444342
61011502310411241
750126543156353
oct7056304656111
91646633285777
10487261953097
11178712740307
127a527060b21
1336c4411530a
14198255a60d3
15ca1c6c7067
hex7173135c49

487261953097 has 2 divisors, whose sum is σ = 487261953098. Its totient is φ = 487261953096.

The previous prime is 487261953071. The next prime is 487261953209. The reversal of 487261953097 is 790359162784.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 324978664761 + 162283288336 = 570069^2 + 402844^2 .

It is a cyclic number.

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

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅487261953097 = 974523906194 is not.

Almost surely, 2487261953097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 22861440, while the sum is 61.

The spelling of 487261953097 in words is "four hundred eighty-seven billion, two hundred sixty-one million, nine hundred fifty-three thousand, ninety-seven".