Base | Representation |
---|---|
bin | 1110010011001001011… |
… | …10000110010000111011 |
3 | 1201222011122212202012222 |
4 | 13021210232012100323 |
5 | 31022203403441002 |
6 | 1013412452354255 |
7 | 50332161516404 |
oct | 7114456062073 |
9 | 1658148782188 |
10 | 491316077627 |
11 | 17a403132051 |
12 | 7b27891598b |
13 | 3743c00757b |
14 | 19acbba89ab |
15 | cba858e1a2 |
hex | 7264b8643b |
491316077627 has 2 divisors, whose sum is σ = 491316077628. Its totient is φ = 491316077626.
The previous prime is 491316077591. The next prime is 491316077657. The reversal of 491316077627 is 726770613194.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-491316077627 is a prime.
It is a super-2 number, since 2×4913160776272 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (491316077657) 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, 245658038813 + 245658038814.
It is an arithmetic number, because the mean of its divisors is an integer number (245658038814).
Almost surely, 2491316077627 is an apocalyptic number.
491316077627 is a deficient number, since it is larger than the sum of its proper divisors (1).
491316077627 is an equidigital number, since it uses as much as digits as its factorization.
491316077627 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2667168, while the sum is 53.
The spelling of 491316077627 in words is "four hundred ninety-one billion, three hundred sixteen million, seventy-seven thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •