Base | Representation |
---|---|
bin | 100000010011101000010… |
… | …101100110001001011001 |
3 | 21212020110122220020000011 |
4 | 200103220111212021121 |
5 | 242333231340200441 |
6 | 4415522251241521 |
7 | 316253113662352 |
oct | 40235025461131 |
9 | 7766418806004 |
10 | 2220101100121 |
11 | 7865a3214023 |
12 | 2ba32b4492a1 |
13 | 13147c198618 |
14 | 7964c452d29 |
15 | 3cb3aedd581 |
hex | 204e8566259 |
2220101100121 has 16 divisors (see below), whose sum is σ = 2302808518800. Its totient is φ = 2137805824000.
The previous prime is 2220101100083. The next prime is 2220101100131. The reversal of 2220101100121 is 1210011010222.
It can be written as a sum of positive squares in 8 ways, for example, as 342622915600 + 1877478184521 = 585340^2 + 1370211^2 .
It is a cyclic number.
It is not a de Polignac number, because 2220101100121 - 229 = 2219564229209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2220101100131) 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 15 ways as a sum of consecutive naturals, for example, 77772111 + ... + 77800651.
It is an arithmetic number, because the mean of its divisors is an integer number (143925532425).
Almost surely, 22220101100121 is an apocalyptic number.
It is an amenable number.
2220101100121 is a deficient number, since it is larger than the sum of its proper divisors (82707418679).
2220101100121 is a wasteful number, since it uses less digits than its factorization.
2220101100121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35660.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2220101100121 its reverse (1210011010222), we get a palindrome (3430112110343).
The spelling of 2220101100121 in words is "two trillion, two hundred twenty billion, one hundred one million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •