Search a number
-
+
495117950953 is a prime number
BaseRepresentation
bin1110011010001110101…
…01000101111111101001
31202022222121202220222011
413031013111011333221
531103000143412303
61015242023555521
750525325100243
oct7150725057751
91668877686864
10495117950953
11180a841a281a
127bb59bbbba1
13378c6879562
1419d6caa7093
15cd2c22a16d
hex7347545fe9

495117950953 has 2 divisors, whose sum is σ = 495117950954. Its totient is φ = 495117950952.

The previous prime is 495117950947. The next prime is 495117951011. The reversal of 495117950953 is 359059711594.

It is an a-pointer prime, because the next prime (495117951011) can be obtained adding 495117950953 to its sum of digits (58).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 357349297369 + 137768653584 = 597787^2 + 371172^2 .

It is a cyclic number.

It is not a de Polignac number, because 495117950953 - 29 = 495117950441 is a prime.

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

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

Almost surely, 2495117950953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7654500, while the sum is 58.

The spelling of 495117950953 in words is "four hundred ninety-five billion, one hundred seventeen million, nine hundred fifty thousand, nine hundred fifty-three".