Base | Representation |
---|---|
bin | 110100010000011010… |
… | …1011010000101101101 |
3 | 101201122210202201210211 |
4 | 1220200311122011231 |
5 | 3314311311133401 |
6 | 123315252302421 |
7 | 11051626304116 |
oct | 1504065320555 |
9 | 351583681724 |
10 | 112220021101 |
11 | 436573048a1 |
12 | 198ba311a11 |
13 | a77541b466 |
14 | 5607d9320d |
15 | 2dbbe6b951 |
hex | 1a20d5a16d |
112220021101 has 4 divisors (see below), whose sum is σ = 113572069632. Its totient is φ = 110867972572.
The previous prime is 112220021093. The next prime is 112220021107. The reversal of 112220021101 is 101120022211.
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 112220021101 - 23 = 112220021093 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 (112220021107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 676024141 + ... + 676024306.
It is an arithmetic number, because the mean of its divisors is an integer number (28393017408).
Almost surely, 2112220021101 is an apocalyptic number.
It is an amenable number.
112220021101 is a deficient number, since it is larger than the sum of its proper divisors (1352048531).
112220021101 is an equidigital number, since it uses as much as digits as its factorization.
112220021101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1352048530.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112220021101 its reverse (101120022211), we get a palindrome (213340043312).
The spelling of 112220021101 in words is "one hundred twelve billion, two hundred twenty million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •