Base | Representation |
---|---|
bin | 110111101111011111010111… |
… | …0100111110011001110100011 |
3 | 2101022001101020100211201221201 |
4 | 1233132332232213303032203 |
5 | 1003231233140402304331 |
6 | 4454450134132502031 |
7 | 205163610643113403 |
oct | 15736765647631643 |
9 | 2338041210751851 |
10 | 490312101213091 |
11 | 1322572157a7603 |
12 | 46ba992a77a917 |
13 | 180783044785b1 |
14 | 89113376b6803 |
15 | 3ba422272da61 |
hex | 1bdefae9f33a3 |
490312101213091 has 2 divisors, whose sum is σ = 490312101213092. Its totient is φ = 490312101213090.
The previous prime is 490312101213071. The next prime is 490312101213149. The reversal of 490312101213091 is 190312101213094.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 490312101213091 - 211 = 490312101211043 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 490312101213091.
It is not a weakly prime, because it can be changed into another prime (490312101213001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 245156050606545 + 245156050606546.
It is an arithmetic number, because the mean of its divisors is an integer number (245156050606546).
Almost surely, 2490312101213091 is an apocalyptic number.
490312101213091 is a deficient number, since it is larger than the sum of its proper divisors (1).
490312101213091 is an equidigital number, since it uses as much as digits as its factorization.
490312101213091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 37.
The spelling of 490312101213091 in words is "four hundred ninety trillion, three hundred twelve billion, one hundred one million, two hundred thirteen thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •