Base | Representation |
---|---|
bin | 110011101100101110… |
… | …0001010101010111101 |
3 | 101121120022220020100122 |
4 | 1213121130022222331 |
5 | 3304333142101023 |
6 | 123000343304325 |
7 | 11010143213363 |
oct | 1473134125275 |
9 | 347508806318 |
10 | 111022222013 |
11 | 430a217169a |
12 | 1962514b0a5 |
13 | a6142179c1 |
14 | 5532c77633 |
15 | 2d4bc182c8 |
hex | 19d970aabd |
111022222013 has 4 divisors (see below), whose sum is σ = 115849275168. Its totient is φ = 106195168860.
The previous prime is 111022222009. The next prime is 111022222019. The reversal of 111022222013 is 310222220111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111022222013 - 22 = 111022222009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111022221982 and 111022222000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111022222019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2413526543 + ... + 2413526588.
It is an arithmetic number, because the mean of its divisors is an integer number (28962318792).
Almost surely, 2111022222013 is an apocalyptic number.
It is an amenable number.
111022222013 is a deficient number, since it is larger than the sum of its proper divisors (4827053155).
111022222013 is an equidigital number, since it uses as much as digits as its factorization.
111022222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4827053154.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 111022222013 its reverse (310222220111), we get a palindrome (421244442124).
The spelling of 111022222013 in words is "one hundred eleven billion, twenty-two million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •