Search a number
-
+
490695 = 3532713
BaseRepresentation
bin1110111110011000111
3220221002220
41313303013
5111200240
614303423
74112412
oct1676307
9827086
10490695
11305737
121b7b73
1314246a
14cab79
159a5d0
hex77cc7

490695 has 8 divisors (see below), whose sum is σ = 785136. Its totient is φ = 261696.

The previous prime is 490663. The next prime is 490697. The reversal of 490695 is 596094.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 490695 - 25 = 490663 is a prime.

It is a congruent number.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 490695.

It is not an unprimeable number, because it can be changed into a prime (490697) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16342 + ... + 16371.

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

2490695 is an apocalyptic number.

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

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

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

The sum of its prime factors is 32721.

The product of its (nonzero) digits is 9720, while the sum is 33.

The square root of 490695 is about 700.4962526666. The cubic root of 490695 is about 78.8746074642.

The spelling of 490695 in words is "four hundred ninety thousand, six hundred ninety-five".

Divisors: 1 3 5 15 32713 98139 163565 490695