Search a number
-
+
490995857577 = 3163665285859
BaseRepresentation
bin1110010010100011010…
…00100011100010101001
31201221100100022212220010
413021101220203202221
531021024414420302
61013321013122133
750321222633301
oct7112150434251
91657310285803
10490995857577
1117a2593a7a85
127b1a9629349
13373ba87a154
1419a9b450601
15cb8a3d916c
hex7251a238a9

490995857577 has 4 divisors (see below), whose sum is σ = 654661143440. Its totient is φ = 327330571716.

The previous prime is 490995857537. The next prime is 490995857603. The reversal of 490995857577 is 775758599094.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 490995857577 - 27 = 490995857449 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (490995857537) 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 in 3 ways as a sum of consecutive naturals, for example, 81832642927 + ... + 81832642932.

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

Almost surely, 2490995857577 is an apocalyptic number.

It is an amenable number.

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

490995857577 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 163665285862.

The product of its (nonzero) digits is 1000188000, while the sum is 75.

The spelling of 490995857577 in words is "four hundred ninety billion, nine hundred ninety-five million, eight hundred fifty-seven thousand, five hundred seventy-seven".

Divisors: 1 3 163665285859 490995857577