Base | Representation |
---|---|
bin | 110011110010100111… |
… | …1011110010010101101 |
3 | 101122002010110122001012 |
4 | 1213211033132102231 |
5 | 3310234334033401 |
6 | 123032135155005 |
7 | 11015066165243 |
oct | 1474517362255 |
9 | 348063418035 |
10 | 111220221101 |
11 | 43193a08300 |
12 | 1967b515a65 |
13 | a646251322 |
14 | 5551298793 |
15 | 2d5e2c98bb |
hex | 19e53de4ad |
111220221101 has 24 divisors (see below), whose sum is σ = 130279871232. Its totient is φ = 94655396000.
The previous prime is 111220221071. The next prime is 111220221103. The reversal of 111220221101 is 101122022111.
It is not a de Polignac number, because 111220221101 - 210 = 111220220077 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 (111220221103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 294350 + ... + 555951.
It is an arithmetic number, because the mean of its divisors is an integer number (5428327968).
Almost surely, 2111220221101 is an apocalyptic number.
111220221101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111220221101 is a deficient number, since it is larger than the sum of its proper divisors (19059650131).
111220221101 is a wasteful number, since it uses less digits than its factorization.
111220221101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 850393 (or 850382 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 111220221101 its reverse (101122022111), we get a palindrome (212342243212).
It can be divided in two parts, 11122022110 and 1, that added together give a palindrome (11122022111).
The spelling of 111220221101 in words is "one hundred eleven billion, two hundred twenty million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.209 sec. • engine limits •