Search a number
-
+
495151468937 is a prime number
BaseRepresentation
bin1110011010010010101…
…00111101000110001001
31202100001221211210222222
413031021110331012021
531103032234001222
61015245222223425
750526213020306
oct7151124750611
91670057753888
10495151468937
11180aa1106334
127bb69284b75
13379007b3898
1419d733100ad
15cd3014b542
hex734953d189

495151468937 has 2 divisors, whose sum is σ = 495151468938. Its totient is φ = 495151468936.

The previous prime is 495151468897. The next prime is 495151468979. The reversal of 495151468937 is 739864151594.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 485831304256 + 9320164681 = 697016^2 + 96541^2 .

It is a cyclic number.

It is not a de Polignac number, because 495151468937 - 210 = 495151467913 is a prime.

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

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

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

Almost surely, 2495151468937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 32659200, while the sum is 62.

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