Base | Representation |
---|---|
bin | 11001001111100011100010… |
… | …010010101100110101010001 |
3 | 112120002102022102210001001221 |
4 | 121033203202102230311101 |
5 | 104022423141433020144 |
6 | 1032041533543325041 |
7 | 32245636565025313 |
oct | 3117434222546521 |
9 | 476072272701057 |
10 | 111020111220049 |
11 | 3241340154a3a9 |
12 | 10550536750781 |
13 | 49c41c7cb63b5 |
14 | 1d5b58b3417b3 |
15 | cc7d4b863d84 |
hex | 64f8e24acd51 |
111020111220049 has 2 divisors, whose sum is σ = 111020111220050. Its totient is φ = 111020111220048.
The previous prime is 111020111219987. The next prime is 111020111220077. The reversal of 111020111220049 is 940022111020111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72902020439824 + 38118090780225 = 8538268^2 + 6173985^2 .
It is a cyclic number.
It is not a de Polignac number, because 111020111220049 - 27 = 111020111219921 is a prime.
It is a super-3 number, since 3×1110201112200493 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (111020111220079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510055610024 + 55510055610025.
It is an arithmetic number, because the mean of its divisors is an integer number (55510055610025).
Almost surely, 2111020111220049 is an apocalyptic number.
It is an amenable number.
111020111220049 is a deficient number, since it is larger than the sum of its proper divisors (1).
111020111220049 is an equidigital number, since it uses as much as digits as its factorization.
111020111220049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 111020111220049 in words is "one hundred eleven trillion, twenty billion, one hundred eleven million, two hundred twenty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •