Base | Representation |
---|---|
bin | 10100100110000010… |
… | …110010010111111111 |
3 | 2010002002200221022021 |
4 | 110212002302113333 |
5 | 330241423220221 |
6 | 14054132301011 |
7 | 1411661155060 |
oct | 244602622777 |
9 | 63062627267 |
10 | 22113101311 |
11 | 94182a6344 |
12 | 4351771767 |
13 | 2115401b42 |
14 | 10dabc2567 |
15 | 896520041 |
hex | 5260b25ff |
22113101311 has 8 divisors (see below), whose sum is σ = 25273288224. Its totient is φ = 18953207520.
The previous prime is 22113101273. The next prime is 22113101317. The reversal of 22113101311 is 11310131122.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22113101311 - 27 = 22113101183 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22113101317) 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 in 7 ways as a sum of consecutive naturals, for example, 123681 + ... + 243973.
It is an arithmetic number, because the mean of its divisors is an integer number (3159161028).
Almost surely, 222113101311 is an apocalyptic number.
22113101311 is a deficient number, since it is larger than the sum of its proper divisors (3160186913).
22113101311 is a wasteful number, since it uses less digits than its factorization.
22113101311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146561.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 22113101311 its reverse (11310131122), we get a palindrome (33423232433).
It can be divided in two parts, 22 and 113101311, that multiplied together give a palindrome (2488228842).
The spelling of 22113101311 in words is "twenty-two billion, one hundred thirteen million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •