Base | Representation |
---|---|
bin | 110111110101010110101101… |
… | …0110010001010101000011101 |
3 | 2101101220102210012000021102202 |
4 | 1233222231122302022220131 |
5 | 1003332434432003332101 |
6 | 4500304321315301245 |
7 | 205306054360013513 |
oct | 15752553262125035 |
9 | 2341812705007382 |
10 | 491118148495901 |
11 | 132538045447393 |
12 | 470b9ba22aa825 |
13 | 18106320237404 |
14 | 893c360c384b3 |
15 | 3bba19b89836b |
hex | 1beab5ac8aa1d |
491118148495901 has 2 divisors, whose sum is σ = 491118148495902. Its totient is φ = 491118148495900.
The previous prime is 491118148495861. The next prime is 491118148495937. The reversal of 491118148495901 is 109594841811194.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 459083974800025 + 32034173695876 = 21426245^2 + 5659874^2 .
It is a cyclic number.
It is not a de Polignac number, because 491118148495901 - 26 = 491118148495837 is a prime.
It is a super-2 number, since 2×4911181484959012 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (491118148492901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 245559074247950 + 245559074247951.
It is an arithmetic number, because the mean of its divisors is an integer number (245559074247951).
Almost surely, 2491118148495901 is an apocalyptic number.
It is an amenable number.
491118148495901 is a deficient number, since it is larger than the sum of its proper divisors (1).
491118148495901 is an equidigital number, since it uses as much as digits as its factorization.
491118148495901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14929920, while the sum is 65.
The spelling of 491118148495901 in words is "four hundred ninety-one trillion, one hundred eighteen billion, one hundred forty-eight million, four hundred ninety-five thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •