Base | Representation |
---|---|
bin | 10000010101001001100… |
… | …101011101011110101101 |
3 | 10222021122111211121011021 |
4 | 100111021211131132231 |
5 | 121341302040133401 |
6 | 2215312523054141 |
7 | 144035453201425 |
oct | 20251145353655 |
9 | 3867574747137 |
10 | 1122221021101 |
11 | 3a2a27568044 |
12 | 1615b1671351 |
13 | 81a9566467b |
14 | 3c45c73d485 |
15 | 1e2d16dc2a1 |
hex | 1054995d7ad |
1122221021101 has 4 divisors (see below), whose sum is σ = 1129368925852. Its totient is φ = 1115073116352.
The previous prime is 1122221021087. The next prime is 1122221021123. The reversal of 1122221021101 is 1011201222211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 377365718601 + 744855302500 = 614301^2 + 863050^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122221021101 - 211 = 1122221019053 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 (1122221021161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3573952140 + ... + 3573952453.
It is an arithmetic number, because the mean of its divisors is an integer number (282342231463).
Almost surely, 21122221021101 is an apocalyptic number.
It is an amenable number.
1122221021101 is a deficient number, since it is larger than the sum of its proper divisors (7147904751).
1122221021101 is an equidigital number, since it uses as much as digits as its factorization.
1122221021101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7147904750.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1122221021101 its reverse (1011201222211), we get a palindrome (2133422243312).
The spelling of 1122221021101 in words is "one trillion, one hundred twenty-two billion, two hundred twenty-one million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •