Base | Representation |
---|---|
bin | 11001010000111000010010… |
… | …111101101111001000001011 |
3 | 112120102010020010211211220122 |
4 | 121100320102331233020023 |
5 | 104030421034230334402 |
6 | 1032151424515013455 |
7 | 32255341120644524 |
oct | 3120702275571013 |
9 | 476363203754818 |
10 | 111111122121227 |
11 | 32448a6485a508 |
12 | 105660b5b9a28b |
13 | 49cc970391647 |
14 | 1d61b425c784b |
15 | cca3c6826ca2 |
hex | 650e12f6f20b |
111111122121227 has 2 divisors, whose sum is σ = 111111122121228. Its totient is φ = 111111122121226.
The previous prime is 111111122121221. The next prime is 111111122121281. The reversal of 111111122121227 is 722121221111111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 111111122121227 - 242 = 106713075610123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111111122121196 and 111111122121205.
It is not a weakly prime, because it can be changed into another prime (111111122121221) 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, 55555561060613 + 55555561060614.
It is an arithmetic number, because the mean of its divisors is an integer number (55555561060614).
Almost surely, 2111111122121227 is an apocalyptic number.
111111122121227 is a deficient number, since it is larger than the sum of its proper divisors (1).
111111122121227 is an equidigital number, since it uses as much as digits as its factorization.
111111122121227 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 224, while the sum is 26.
Adding to 111111122121227 its reverse (722121221111111), we get a palindrome (833232343232338).
The spelling of 111111122121227 in words is "one hundred eleven trillion, one hundred eleven billion, one hundred twenty-two million, one hundred twenty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •