Base | Representation |
---|---|
bin | 1100110111101101011… |
… | …1100010101100111001 |
3 | 210010201202022100102022 |
4 | 3031323113202230321 |
5 | 12110314423213423 |
6 | 245324501044225 |
7 | 21655250230442 |
oct | 3157327425471 |
9 | 703652270368 |
10 | 221113101113 |
11 | 858566435a3 |
12 | 36a2a3b6675 |
13 | 17b0a4b3a08 |
14 | a9b81562c9 |
15 | 5b41cb2dc8 |
hex | 337b5e2b39 |
221113101113 has 8 divisors (see below), whose sum is σ = 224424488160. Its totient is φ = 217802043360.
The previous prime is 221113101109. The next prime is 221113101133. The reversal of 221113101113 is 311101311122.
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 221113101113 - 22 = 221113101109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221113101091 and 221113101100.
It is not an unprimeable number, because it can be changed into a prime (221113101133) 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 in 7 ways as a sum of consecutive naturals, for example, 1495253 + ... + 1636461.
It is an arithmetic number, because the mean of its divisors is an integer number (28053061020).
Almost surely, 2221113101113 is an apocalyptic number.
It is an amenable number.
221113101113 is a deficient number, since it is larger than the sum of its proper divisors (3311387047).
221113101113 is a wasteful number, since it uses less digits than its factorization.
221113101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164647.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 221113101113 its reverse (311101311122), we get a palindrome (532214412235).
The spelling of 221113101113 in words is "two hundred twenty-one billion, one hundred thirteen million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •