Base | Representation |
---|---|
bin | 10001110000010100010… |
… | …010011110110010111001 |
3 | 11022122022122021220022020 |
4 | 101300110102132302321 |
5 | 124442241420213423 |
6 | 2332302235145053 |
7 | 154102330145622 |
oct | 21602422366271 |
9 | 4278278256266 |
10 | 1220111101113 |
11 | 43049a9aa013 |
12 | 1785708a5189 |
13 | 8b095cc1c38 |
14 | 430a7490a49 |
15 | 21b105a04e3 |
hex | 11c1449ecb9 |
1220111101113 has 8 divisors (see below), whose sum is σ = 1626927934368. Its totient is φ = 813350834304.
The previous prime is 1220111101091. The next prime is 1220111101133. The reversal of 1220111101113 is 3111011110221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1220111101113 - 221 = 1220109003961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1220111101092 and 1220111101101.
It is not an unprimeable number, because it can be changed into a prime (1220111101133) 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, 14091256 + ... + 14177577.
It is an arithmetic number, because the mean of its divisors is an integer number (203365991796).
Almost surely, 21220111101113 is an apocalyptic number.
It is an amenable number.
1220111101113 is a deficient number, since it is larger than the sum of its proper divisors (406816833255).
1220111101113 is a wasteful number, since it uses less digits than its factorization.
1220111101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28283223.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 1220111101113 its reverse (3111011110221), we get a palindrome (4331122211334).
The spelling of 1220111101113 in words is "one trillion, two hundred twenty billion, one hundred eleven million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •