Base | Representation |
---|---|
bin | 1110010010011111101… |
… | …10101000111111011011 |
3 | 1201221021021010201210122 |
4 | 13021033312220333123 |
5 | 31020444243323413 |
6 | 1013314025103455 |
7 | 50320411050635 |
oct | 7111766507733 |
9 | 1657237121718 |
10 | 490965995483 |
11 | 17a243561167 |
12 | 7b19b627b8b |
13 | 373b4622b82 |
14 | 19a974b9a55 |
15 | cb8798b108 |
hex | 724fda8fdb |
490965995483 has 2 divisors, whose sum is σ = 490965995484. Its totient is φ = 490965995482.
The previous prime is 490965995479. The next prime is 490965995549. The reversal of 490965995483 is 384599569094.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 490965995483 - 22 = 490965995479 is a prime.
It is a super-2 number, since 2×4909659954832 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (490965995683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 245482997741 + 245482997742.
It is an arithmetic number, because the mean of its divisors is an integer number (245482997742).
Almost surely, 2490965995483 is an apocalyptic number.
490965995483 is a deficient number, since it is larger than the sum of its proper divisors (1).
490965995483 is an equidigital number, since it uses as much as digits as its factorization.
490965995483 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 377913600, while the sum is 71.
The spelling of 490965995483 in words is "four hundred ninety billion, nine hundred sixty-five million, nine hundred ninety-five thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •