Base | Representation |
---|---|
bin | 110011101100001101… |
… | …0101010110101000011 |
3 | 101121112010120220211122 |
4 | 1213120122222311003 |
5 | 3304314243132402 |
6 | 122554531302455 |
7 | 11006544242606 |
oct | 1473032526503 |
9 | 347463526748 |
10 | 111005052227 |
11 | 43093504793 |
12 | 1961b44aa2b |
13 | a6107b5874 |
14 | 553088833d |
15 | 2d4a475ca2 |
hex | 19d86aad43 |
111005052227 has 2 divisors, whose sum is σ = 111005052228. Its totient is φ = 111005052226.
The previous prime is 111005052199. The next prime is 111005052229. The reversal of 111005052227 is 722250500111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111005052227 is a prime.
Together with 111005052229, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 111005052196 and 111005052205.
It is not a weakly prime, because it can be changed into another prime (111005052229) 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, 55502526113 + 55502526114.
It is an arithmetic number, because the mean of its divisors is an integer number (55502526114).
Almost surely, 2111005052227 is an apocalyptic number.
111005052227 is a deficient number, since it is larger than the sum of its proper divisors (1).
111005052227 is an equidigital number, since it uses as much as digits as its factorization.
111005052227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1400, while the sum is 26.
Adding to 111005052227 its reverse (722250500111), we get a palindrome (833255552338).
The spelling of 111005052227 in words is "one hundred eleven billion, five million, fifty-two thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •