Search a number
-
+
490809427657 is a prime number
BaseRepresentation
bin1110010010001101000…
…01011000011011001001
31201220212100112021010021
413021012201120123021
531020134203141112
61013250313220441
750313500204653
oct7110641303311
91656770467107
10490809427657
1117a17314346a
127b157101721
133738b0646a3
1419a807a16d3
15cb78d60907
hex72468586c9

490809427657 has 2 divisors, whose sum is σ = 490809427658. Its totient is φ = 490809427656.

The previous prime is 490809427649. The next prime is 490809427697. The reversal of 490809427657 is 756724908094.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 484278201801 + 6531225856 = 695901^2 + 80816^2 .

It is a cyclic number.

It is not a de Polignac number, because 490809427657 - 23 = 490809427649 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 490809427595 and 490809427604.

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

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

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

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

Almost surely, 2490809427657 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 490809427657 in words is "four hundred ninety billion, eight hundred nine million, four hundred twenty-seven thousand, six hundred fifty-seven".