Base | Representation |
---|---|
bin | 11101010000001… |
… | …010110000101101 |
3 | 1021012111002100211 |
4 | 131100022300231 |
5 | 2001114341040 |
6 | 120411022421 |
7 | 15106353421 |
oct | 3520126055 |
9 | 1235432324 |
10 | 490777645 |
11 | 232038566 |
12 | 11843aa11 |
13 | 7a8a6497 |
14 | 49274b81 |
15 | 2d1458ea |
hex | 1d40ac2d |
490777645 has 16 divisors (see below), whose sum is σ = 597698352. Its totient is φ = 386821120.
The previous prime is 490777627. The next prime is 490777663. The reversal of 490777645 is 546777094.
It is an interprime number because it is at equal distance from previous prime (490777627) and next prime (490777663).
It can be written as a sum of positive squares in 8 ways, for example, as 3118756 + 487658889 = 1766^2 + 22083^2 .
It is a de Polignac number, because none of the positive numbers 2k-490777645 is a prime.
It is a super-3 number, since 3×4907776453 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95235 + ... + 100255.
It is an arithmetic number, because the mean of its divisors is an integer number (37356147).
Almost surely, 2490777645 is an apocalyptic number.
It is an amenable number.
490777645 is a deficient number, since it is larger than the sum of its proper divisors (106920707).
490777645 is a wasteful number, since it uses less digits than its factorization.
490777645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5312.
The product of its (nonzero) digits is 1481760, while the sum is 49.
The square root of 490777645 is about 22153.5018676506. The cubic root of 490777645 is about 788.7903535119.
The spelling of 490777645 in words is "four hundred ninety million, seven hundred seventy-seven thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •