Base | Representation |
---|---|
bin | 1001001100011110111000… |
… | …11110101101101011100101 |
3 | 2122121000122020110011212220 |
4 | 10212033130132231223211 |
5 | 10122241241141214341 |
6 | 111000553525302553 |
7 | 4154566115015412 |
oct | 446173436555345 |
9 | 78530566404786 |
10 | 20220110101221 |
11 | 64963340189a8 |
12 | 2326961b64a59 |
13 | b38995a49c94 |
14 | 4dc9310c5109 |
15 | 250e88a73a66 |
hex | 1263dc7adae5 |
20220110101221 has 8 divisors (see below), whose sum is σ = 27006871495104. Its totient is φ = 13456711054080.
The previous prime is 20220110101201. The next prime is 20220110101253. The reversal of 20220110101221 is 12210101102202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20220110101221 - 25 = 20220110101189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20220110101221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20220110101201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5840584665 + ... + 5840588126.
It is an arithmetic number, because the mean of its divisors is an integer number (3375858936888).
Almost surely, 220220110101221 is an apocalyptic number.
It is an amenable number.
20220110101221 is a deficient number, since it is larger than the sum of its proper divisors (6786761393883).
20220110101221 is a wasteful number, since it uses less digits than its factorization.
20220110101221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11681173371.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20220110101221 its reverse (12210101102202), we get a palindrome (32430211203423).
The spelling of 20220110101221 in words is "twenty trillion, two hundred twenty billion, one hundred ten million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •