Base | Representation |
---|---|
bin | 11101001111000… |
… | …100011100001001 |
3 | 1021011221110020211 |
4 | 131033010130021 |
5 | 2001031131414 |
6 | 120400521121 |
7 | 15104043601 |
oct | 3517043411 |
9 | 1234843224 |
10 | 490489609 |
11 | 231961115 |
12 | 1183201a1 |
13 | 7a80534c |
14 | 491dbc01 |
15 | 2d0da3c4 |
hex | 1d3c4709 |
490489609 has 3 divisors (see below), whose sum is σ = 490511757. Its totient is φ = 490467462.
The previous prime is 490489589. The next prime is 490489639. The reversal of 490489609 is 906984094.
The square root of 490489609 is 22147.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 490489609 - 27 = 490489481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (490489639) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 11074 + ... + 33220.
It is an arithmetic number, because the mean of its divisors is an integer number (163503919).
Almost surely, 2490489609 is an apocalyptic number.
490489609 is the 22147-th square number.
490489609 is the 11074-th centered octagonal number.
It is an amenable number.
490489609 is a deficient number, since it is larger than the sum of its proper divisors (22148).
490489609 is an frugal number, since it uses more digits than its factorization.
490489609 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44294 (or 22147 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 49.
The cubic root of 490489609 is about 788.6360103772.
Multiplying 490489609 by its sum of digits (49), we get a square (24033990841 = 1550292).
The spelling of 490489609 in words is "four hundred ninety million, four hundred eighty-nine thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •