Base | Representation |
---|---|
bin | 110011101111101100… |
… | …1101000001111111111 |
3 | 101121211022001122211221 |
4 | 1213133121220033333 |
5 | 3310034242020111 |
6 | 123014314454211 |
7 | 11012466166654 |
oct | 1473731501777 |
9 | 347738048757 |
10 | 111122220031 |
11 | 43143661689 |
12 | 19652734367 |
13 | a62bb5a624 |
14 | 5542267c2b |
15 | 2d558bc371 |
hex | 19df6683ff |
111122220031 has 2 divisors, whose sum is σ = 111122220032. Its totient is φ = 111122220030.
The previous prime is 111122220029. The next prime is 111122220059. The reversal of 111122220031 is 130022221111.
It is a weak prime.
It is an emirp because it is prime and its reverse (130022221111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111122220031 - 21 = 111122220029 is a prime.
It is a super-2 number, since 2×1111222200312 (a number of 23 digits) contains 22 as substring.
Together with 111122220029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 111122219987 and 111122220014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111122230031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55561110015 + 55561110016.
It is an arithmetic number, because the mean of its divisors is an integer number (55561110016).
Almost surely, 2111122220031 is an apocalyptic number.
111122220031 is a deficient number, since it is larger than the sum of its proper divisors (1).
111122220031 is an equidigital number, since it uses as much as digits as its factorization.
111122220031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 111122220031 its reverse (130022221111), we get a palindrome (241144441142).
The spelling of 111122220031 in words is "one hundred eleven billion, one hundred twenty-two million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •