Base | Representation |
---|---|
bin | 1110010010000111000… |
… | …01001000001111001011 |
3 | 1201220201211200210010112 |
4 | 13021003201020033023 |
5 | 31020033302422312 |
6 | 1013241313104535 |
7 | 50312315632112 |
oct | 7110341101713 |
9 | 1656654623115 |
10 | 490759029707 |
11 | 17a147750771 |
12 | 7b14225814b |
13 | 3738079a10b |
14 | 19a77c02c79 |
15 | cb74707d22 |
hex | 72438483cb |
490759029707 has 2 divisors, whose sum is σ = 490759029708. Its totient is φ = 490759029706.
The previous prime is 490759029697. The next prime is 490759029779. The reversal of 490759029707 is 707920957094.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 490759029707 - 26 = 490759029643 is a prime.
It is a super-2 number, since 2×4907590297072 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (490759029797) by changing a digit.
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 as a sum of consecutive naturals, namely, 245379514853 + 245379514854.
It is an arithmetic number, because the mean of its divisors is an integer number (245379514854).
Almost surely, 2490759029707 is an apocalyptic number.
490759029707 is a deficient number, since it is larger than the sum of its proper divisors (1).
490759029707 is an equidigital number, since it uses as much as digits as its factorization.
490759029707 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10001880, while the sum is 59.
The spelling of 490759029707 in words is "four hundred ninety billion, seven hundred fifty-nine million, twenty-nine thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •