Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …0110000111111100000101 |
3 | 1102222122100020002202111211 |
4 | 2200032303112013330011 |
5 | 2420401022041212442 |
6 | 35230215504131421 |
7 | 2214343044406204 |
oct | 240166326077405 |
9 | 42878306082454 |
10 | 11011010100997 |
11 | 356581a166835 |
12 | 129a011006b71 |
13 | 61b44547720a |
14 | 2a0d1591523b |
15 | 14164d091617 |
hex | a03b3587f05 |
11011010100997 has 2 divisors, whose sum is σ = 11011010100998. Its totient is φ = 11011010100996.
The previous prime is 11011010100991. The next prime is 11011010101019. The reversal of 11011010100997 is 79900101011011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9967413008641 + 1043597092356 = 3157121^2 + 1021566^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011010100997 - 219 = 11011009576709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011010100991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505505050498 + 5505505050499.
It is an arithmetic number, because the mean of its divisors is an integer number (5505505050499).
Almost surely, 211011010100997 is an apocalyptic number.
It is an amenable number.
11011010100997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011010100997 is an equidigital number, since it uses as much as digits as its factorization.
11011010100997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 31.
The spelling of 11011010100997 in words is "eleven trillion, eleven billion, ten million, one hundred thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •