Base | Representation |
---|---|
bin | 1010000000111100010010… |
… | …1100001101000110100111 |
3 | 1102222200002111200010211102 |
4 | 2200033010230031012213 |
5 | 2420402121040230431 |
6 | 35230304421230315 |
7 | 2214353210025461 |
oct | 240170454150647 |
9 | 42880074603742 |
10 | 11011301101991 |
11 | 3565959454123 |
12 | 129a09256239b |
13 | 61b490843c58 |
14 | 2a0d42425131 |
15 | 1416688c3dcb |
hex | a03c4b0d1a7 |
11011301101991 has 2 divisors, whose sum is σ = 11011301101992. Its totient is φ = 11011301101990.
The previous prime is 11011301101981. The next prime is 11011301102051. The reversal of 11011301101991 is 19910110311011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11011301101991 - 234 = 10994121232807 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011301101981) 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, 5505650550995 + 5505650550996.
It is an arithmetic number, because the mean of its divisors is an integer number (5505650550996).
Almost surely, 211011301101991 is an apocalyptic number.
11011301101991 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011301101991 is an equidigital number, since it uses as much as digits as its factorization.
11011301101991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 29.
The spelling of 11011301101991 in words is "eleven trillion, eleven billion, three hundred one million, one hundred one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •