Base | Representation |
---|---|
bin | 1001001001100110011110… |
… | …01001101000001110001101 |
3 | 2122020120002012122210210102 |
4 | 10210303033021220032031 |
5 | 10114131004132102341 |
6 | 110443301243020445 |
7 | 4144462445644100 |
oct | 444631711501615 |
9 | 78216065583712 |
10 | 20121102222221 |
11 | 6458347715010 |
12 | 230b73050a725 |
13 | b2c5479493b0 |
14 | 4d7c1bb20737 |
15 | 24d5e19b0c9b |
hex | 124ccf26838d |
20121102222221 has 24 divisors (see below), whose sum is σ = 27498169679904. Its totient is φ = 14472720874080.
The previous prime is 20121102222197. The next prime is 20121102222227. The reversal of 20121102222221 is 12222220112102.
It is not a de Polignac number, because 20121102222221 - 234 = 20103922353037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20121102222193 and 20121102222202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121102222227) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1435778795 + ... + 1435792808.
It is an arithmetic number, because the mean of its divisors is an integer number (1145757069996).
Almost surely, 220121102222221 is an apocalyptic number.
It is an amenable number.
20121102222221 is a deficient number, since it is larger than the sum of its proper divisors (7377067457683).
20121102222221 is a wasteful number, since it uses less digits than its factorization.
20121102222221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2871571641 (or 2871571634 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 20121102222221 its reverse (12222220112102), we get a palindrome (32343322334323).
The spelling of 20121102222221 in words is "twenty trillion, one hundred twenty-one billion, one hundred two million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •