Base | Representation |
---|---|
bin | 1100110011101001010… |
… | …1011001111111010101 |
3 | 210000220201020210101112 |
4 | 3030322111121333111 |
5 | 12101101114201401 |
6 | 245024323304405 |
7 | 21616231221200 |
oct | 3147225317725 |
9 | 700821223345 |
10 | 220022022101 |
11 | 85346771802 |
12 | 36784b1b105 |
13 | 1799543772b |
14 | a91329a937 |
15 | 5acb0e03bb |
hex | 333a559fd5 |
220022022101 has 6 divisors (see below), whose sum is σ = 255943984950. Its totient is φ = 188590304616.
The previous prime is 220022022089. The next prime is 220022022127. The reversal of 220022022101 is 101220220022.
It can be written as a sum of positive squares in only one way, i.e., 194141578225 + 25880443876 = 440615^2 + 160874^2 .
It is a de Polignac number, because none of the positive numbers 2k-220022022101 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 (220022022161) 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 5 ways as a sum of consecutive naturals, for example, 2245122626 + ... + 2245122723.
It is an arithmetic number, because the mean of its divisors is an integer number (42657330825).
Almost surely, 2220022022101 is an apocalyptic number.
It is an amenable number.
220022022101 is a deficient number, since it is larger than the sum of its proper divisors (35921962849).
220022022101 is an equidigital number, since it uses as much as digits as its factorization.
220022022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4490245363 (or 4490245356 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 220022022101 its reverse (101220220022), we get a palindrome (321242242123).
The spelling of 220022022101 in words is "two hundred twenty billion, twenty-two million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •