Base | Representation |
---|---|
bin | 11001010000000101000000… |
… | …011010101001101101100011 |
3 | 112120012212002002010100200011 |
4 | 121100011000122221231203 |
5 | 104024020242311213331 |
6 | 1032110240050305351 |
7 | 32251351310335204 |
oct | 3120050032515543 |
9 | 476185062110604 |
10 | 111056050101091 |
11 | 32427674069687 |
12 | 105574a6588257 |
13 | 49c7704897b94 |
14 | 1d5d1da4095ab |
15 | cc8c51a513b1 |
hex | 6501406a9b63 |
111056050101091 has 2 divisors, whose sum is σ = 111056050101092. Its totient is φ = 111056050101090.
The previous prime is 111056050100977. The next prime is 111056050101133. The reversal of 111056050101091 is 190101050650111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111056050101091 - 29 = 111056050100579 is a prime.
It is a super-2 number, since 2×1110560501010912 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111056050101391) 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, 55528025050545 + 55528025050546.
It is an arithmetic number, because the mean of its divisors is an integer number (55528025050546).
Almost surely, 2111056050101091 is an apocalyptic number.
111056050101091 is a deficient number, since it is larger than the sum of its proper divisors (1).
111056050101091 is an equidigital number, since it uses as much as digits as its factorization.
111056050101091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 31.
The spelling of 111056050101091 in words is "one hundred eleven trillion, fifty-six billion, fifty million, one hundred one thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •