Base | Representation |
---|---|
bin | 1110010011001001011… |
… | …10000110010011010011 |
3 | 1201222011122212202102121 |
4 | 13021210232012103103 |
5 | 31022203403442104 |
6 | 1013412452355111 |
7 | 50332161520012 |
oct | 7114456062323 |
9 | 1658148782377 |
10 | 491316077779 |
11 | 17a40313217a |
12 | 7b278915a97 |
13 | 3743c007667 |
14 | 19acbba8a79 |
15 | cba858e254 |
hex | 7264b864d3 |
491316077779 has 2 divisors, whose sum is σ = 491316077780. Its totient is φ = 491316077778.
The previous prime is 491316077741. The next prime is 491316077797. The reversal of 491316077779 is 977770613194.
Together with next prime (491316077797) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 491316077779 - 29 = 491316077267 is a prime.
It is not a weakly prime, because it can be changed into another prime (491316077719) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 245658038889 + 245658038890.
It is an arithmetic number, because the mean of its divisors is an integer number (245658038890).
Almost surely, 2491316077779 is an apocalyptic number.
491316077779 is a deficient number, since it is larger than the sum of its proper divisors (1).
491316077779 is an equidigital number, since it uses as much as digits as its factorization.
491316077779 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14002632, while the sum is 61.
The spelling of 491316077779 in words is "four hundred ninety-one billion, three hundred sixteen million, seventy-seven thousand, seven hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •