Search a number
-
+
490670137 = 5971117133
BaseRepresentation
bin11101001111110…
…000100000111001
31021012021121220001
4131033300200321
52001102421022
6120404433001
715105425116
oct3517604071
91235247801
10490670137
11231a74811
121183a8761
137a869579
144924790d
152d123b27
hex1d3f0839

490670137 has 8 divisors (see below), whose sum is σ = 506018880. Its totient is φ = 475555920.

The previous prime is 490670101. The next prime is 490670171. The reversal of 490670137 is 731076094.

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

It is a cyclic number.

It is not a de Polignac number, because 490670137 - 215 = 490637369 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2490670137 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 117263.

The product of its (nonzero) digits is 31752, while the sum is 37.

The square root of 490670137 is about 22151.0753012128. The cubic root of 490670137 is about 788.7327527721.

The spelling of 490670137 in words is "four hundred ninety million, six hundred seventy thousand, one hundred thirty-seven".

Divisors: 1 59 71 4189 117133 6910847 8316443 490670137