Base | Representation |
---|---|
bin | 1110010001001001111… |
… | …11001111111101101101 |
3 | 1201212102010220102221101 |
4 | 13020210333033331231 |
5 | 31013011142110411 |
6 | 1013114415003101 |
7 | 50263526213224 |
oct | 7104477177555 |
9 | 1655363812841 |
10 | 490246831981 |
11 | 179a04612a65 |
12 | 7b01a809491 |
13 | 372cb63403a |
14 | 19a29b93cbb |
15 | cb447808c1 |
hex | 7224fcff6d |
490246831981 has 4 divisors (see below), whose sum is σ = 490278311964. Its totient is φ = 490215352000.
The previous prime is 490246831967. The next prime is 490246832011. The reversal of 490246831981 is 189138642094.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 355013388900 + 135233443081 = 595830^2 + 367741^2 .
It is a cyclic number.
It is not a de Polignac number, because 490246831981 - 221 = 490244734829 is a prime.
It is a super-2 number, since 2×4902468319812 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (490246031981) 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, 15716620 + ... + 15747781.
It is an arithmetic number, because the mean of its divisors is an integer number (122569577991).
Almost surely, 2490246831981 is an apocalyptic number.
It is an amenable number.
490246831981 is a deficient number, since it is larger than the sum of its proper divisors (31479983).
490246831981 is a wasteful number, since it uses less digits than its factorization.
490246831981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31479982.
The product of its (nonzero) digits is 2985984, while the sum is 55.
The spelling of 490246831981 in words is "four hundred ninety billion, two hundred forty-six million, eight hundred thirty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •