Base | Representation |
---|---|
bin | 1110010010011101010… |
… | …10101010111111110111 |
3 | 1201221012212122221221021 |
4 | 13021032222222333313 |
5 | 31020424144041014 |
6 | 1013312034202011 |
7 | 50320046555341 |
oct | 7111652527767 |
9 | 1657185587837 |
10 | 490946080759 |
11 | 17a233299a12 |
12 | 7b194a23307 |
13 | 373b046c504 |
14 | 19a949b4291 |
15 | cb85d55624 |
hex | 724eaaaff7 |
490946080759 has 4 divisors (see below), whose sum is σ = 490947482680. Its totient is φ = 490944678840.
The previous prime is 490946080753. The next prime is 490946080789. The reversal of 490946080759 is 957080649094.
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 a cyclic number.
It is not a de Polignac number, because 490946080759 - 223 = 490937692151 is a prime.
It is a super-5 number, since 5×4909460807595 (a number of 60 digits) contains 55555 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 490946080697 and 490946080706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (490946080753) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 320524 + ... + 1041454.
It is an arithmetic number, because the mean of its divisors is an integer number (122736870670).
Almost surely, 2490946080759 is an apocalyptic number.
490946080759 is a deficient number, since it is larger than the sum of its proper divisors (1401921).
490946080759 is an equidigital number, since it uses as much as digits as its factorization.
490946080759 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1401920.
The product of its (nonzero) digits is 19595520, while the sum is 61.
The spelling of 490946080759 in words is "four hundred ninety billion, nine hundred forty-six million, eighty thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •