Base | Representation |
---|---|
bin | 1110010010001100010… |
… | …11011001001010001010 |
3 | 1201220211221200102011220 |
4 | 13021012023121022022 |
5 | 31020131214212443 |
6 | 1013245545502510 |
7 | 50313400206561 |
oct | 7110613311212 |
9 | 1656757612156 |
10 | 490803663498 |
11 | 17a16a9667a5 |
12 | 7b1551a1a36 |
13 | 37389ac6b45 |
14 | 19a7db00bd8 |
15 | cb785c2a83 |
hex | 72462d928a |
490803663498 has 16 divisors (see below), whose sum is σ = 1004435404896. Its totient is φ = 159796541520.
The previous prime is 490803663473. The next prime is 490803663503. The reversal of 490803663498 is 894366308094.
It is a super-2 number, since 2×4908036634982 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 951169633 + ... + 951170148.
It is an arithmetic number, because the mean of its divisors is an integer number (62777212806).
Almost surely, 2490803663498 is an apocalyptic number.
490803663498 is an abundant number, since it is smaller than the sum of its proper divisors (513631741398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
490803663498 is a wasteful number, since it uses less digits than its factorization.
490803663498 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1902339829.
The product of its (nonzero) digits is 26873856, while the sum is 60.
The spelling of 490803663498 in words is "four hundred ninety billion, eight hundred three million, six hundred sixty-three thousand, four hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •