Base | Representation |
---|---|
bin | 110011101111000010… |
… | …0111010001010001101 |
3 | 101121202202021022222202 |
4 | 1213132010322022031 |
5 | 3310013100324044 |
6 | 123012202451245 |
7 | 11012106341021 |
oct | 1473604721215 |
9 | 347682238882 |
10 | 111100011149 |
11 | 43132072836 |
12 | 19647203b25 |
13 | a62738298a |
14 | 553d326381 |
15 | 2d53981c4e |
hex | 19de13a28d |
111100011149 has 2 divisors, whose sum is σ = 111100011150. Its totient is φ = 111100011148.
The previous prime is 111100011103. The next prime is 111100011157. The reversal of 111100011149 is 941110001111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99339693124 + 11760318025 = 315182^2 + 108445^2 .
It is a cyclic number.
It is not a de Polignac number, because 111100011149 - 216 = 111099945613 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111100011149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111100011349) 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, 55550005574 + 55550005575.
It is an arithmetic number, because the mean of its divisors is an integer number (55550005575).
Almost surely, 2111100011149 is an apocalyptic number.
It is an amenable number.
111100011149 is a deficient number, since it is larger than the sum of its proper divisors (1).
111100011149 is an equidigital number, since it uses as much as digits as its factorization.
111100011149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 111100011149 in words is "one hundred eleven billion, one hundred million, eleven thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •