Base | Representation |
---|---|
bin | 1110010001100011101… |
… | …01100000011001111001 |
3 | 1201212222011111111112220 |
4 | 13020301311200121321 |
5 | 31013431332203224 |
6 | 1013152034554253 |
7 | 50302054313100 |
oct | 7106165403171 |
9 | 1655864444486 |
10 | 490462381689 |
11 | 17a005256715 |
12 | 7b07aa38989 |
13 | 373341a3c47 |
14 | 19a4a663037 |
15 | cb5865c279 |
hex | 7231d60679 |
490462381689 has 24 divisors (see below), whose sum is σ = 761634984960. Its totient is φ = 279926073504.
The previous prime is 490462381687. The next prime is 490462381691. The reversal of 490462381689 is 986183264094.
It is an interprime number because it is at equal distance from previous prime (490462381687) and next prime (490462381691).
It is not a de Polignac number, because 490462381689 - 21 = 490462381687 is a prime.
It is not an unprimeable number, because it can be changed into a prime (490462381687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1890489 + ... + 2134214.
It is an arithmetic number, because the mean of its divisors is an integer number (31734791040).
Almost surely, 2490462381689 is an apocalyptic number.
490462381689 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
It is an amenable number.
490462381689 is a deficient number, since it is larger than the sum of its proper divisors (271172603271).
490462381689 is a wasteful number, since it uses less digits than its factorization.
490462381689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4025549 (or 4025542 counting only the distinct ones).
The product of its (nonzero) digits is 17915904, while the sum is 60.
The spelling of 490462381689 in words is "four hundred ninety billion, four hundred sixty-two million, three hundred eighty-one thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •