Base | Representation |
---|---|
bin | 1110010000111100110… |
… | …10010010111110010001 |
3 | 1201212010110021001210020 |
4 | 13020132122102332101 |
5 | 31012244414403211 |
6 | 1013055433454053 |
7 | 50261016232230 |
oct | 7103632227621 |
9 | 1655113231706 |
10 | 490136481681 |
11 | 1799582a2170 |
12 | 7aba9871329 |
13 | 372b18083c2 |
14 | 19a1926ab17 |
15 | cb39c34306 |
hex | 721e692f91 |
490136481681 has 64 divisors (see below), whose sum is σ = 843203450880. Its totient is φ = 245738626560.
The previous prime is 490136481661. The next prime is 490136481691. The reversal of 490136481681 is 186184631094.
It is not a de Polignac number, because 490136481681 - 27 = 490136481553 is a prime.
It is a super-2 number, since 2×4901364816812 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (490136481661) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18589950 + ... + 18616296.
It is an arithmetic number, because the mean of its divisors is an integer number (13175053920).
Almost surely, 2490136481681 is an apocalyptic number.
It is an amenable number.
490136481681 is a deficient number, since it is larger than the sum of its proper divisors (353066969199).
490136481681 is a wasteful number, since it uses less digits than its factorization.
490136481681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29174.
The product of its (nonzero) digits is 995328, while the sum is 51.
The spelling of 490136481681 in words is "four hundred ninety billion, one hundred thirty-six million, four hundred eighty-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •