Base | Representation |
---|---|
bin | 110011110010011010… |
… | …0110001000100001101 |
3 | 101122001122021221111012 |
4 | 1213210310301010031 |
5 | 3310231041020414 |
6 | 123031325135005 |
7 | 11014652526215 |
oct | 1474464610415 |
9 | 348048257435 |
10 | 111213220109 |
11 | 4318aa66362 |
12 | 196790ba465 |
13 | a64496c824 |
14 | 5550395245 |
15 | 2d5d89533e |
hex | 19e4d3110d |
111213220109 has 2 divisors, whose sum is σ = 111213220110. Its totient is φ = 111213220108.
The previous prime is 111213220043. The next prime is 111213220117. The reversal of 111213220109 is 901022312111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74654632900 + 36558587209 = 273230^2 + 191203^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111213220109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111213210109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55606610054 + 55606610055.
It is an arithmetic number, because the mean of its divisors is an integer number (55606610055).
Almost surely, 2111213220109 is an apocalyptic number.
It is an amenable number.
111213220109 is a deficient number, since it is larger than the sum of its proper divisors (1).
111213220109 is an equidigital number, since it uses as much as digits as its factorization.
111213220109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 23.
The spelling of 111213220109 in words is "one hundred eleven billion, two hundred thirteen million, two hundred twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •