Base | Representation |
---|---|
bin | 1110010001111111101… |
… | …10001101110000111111 |
3 | 1201220120112211010121111 |
4 | 13020333312031300333 |
5 | 31014422021323021 |
6 | 1013231233142451 |
7 | 50310640331104 |
oct | 7107766156077 |
9 | 1656515733544 |
10 | 490697448511 |
11 | 17a115a0a916 |
12 | 7b1256baa27 |
13 | 37370ab853a |
14 | 19a6d972aab |
15 | cb6e0e18e1 |
hex | 723fd8dc3f |
490697448511 has 8 divisors (see below), whose sum is σ = 503970266720. Its totient is φ = 477425194848.
The previous prime is 490697448497. The next prime is 490697448559. The reversal of 490697448511 is 115844796094.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 490697448511 - 27 = 490697448383 is a prime.
It is a super-2 number, since 2×4906974485112 (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 (490697442511) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2092270 + ... + 2314948.
It is an arithmetic number, because the mean of its divisors is an integer number (62996283340).
Almost surely, 2490697448511 is an apocalyptic number.
490697448511 is a deficient number, since it is larger than the sum of its proper divisors (13272818209).
490697448511 is a wasteful number, since it uses less digits than its factorization.
490697448511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282273.
The product of its (nonzero) digits is 8709120, while the sum is 58.
The spelling of 490697448511 in words is "four hundred ninety billion, six hundred ninety-seven million, four hundred forty-eight thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •