Base | Representation |
---|---|
bin | 1001000110101100001110… |
… | …01010000010001100000101 |
3 | 2121212222222120212202221021 |
4 | 10203112013022002030011 |
5 | 10111011213142334341 |
6 | 110325323201151141 |
7 | 4134322526054536 |
oct | 443260712021405 |
9 | 77788876782837 |
10 | 20021110121221 |
11 | 64199a5794610 |
12 | 22b428532b4b1 |
13 | b22ca0974121 |
14 | 4d3053b5868d |
15 | 24abdd2d69d1 |
hex | 123587282305 |
20021110121221 has 64 divisors (see below), whose sum is σ = 23447607321600. Its totient is φ = 16904171750400.
The previous prime is 20021110121161. The next prime is 20021110121231. The reversal of 20021110121221 is 12212101112002.
It is not a de Polignac number, because 20021110121221 - 27 = 20021110121093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20021110121195 and 20021110121204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021110121231) 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 63 ways as a sum of consecutive naturals, for example, 2147491866 + ... + 2147501188.
It is an arithmetic number, because the mean of its divisors is an integer number (366368864400).
Almost surely, 220021110121221 is an apocalyptic number.
It is an amenable number.
20021110121221 is a deficient number, since it is larger than the sum of its proper divisors (3426497200379).
20021110121221 is a wasteful number, since it uses less digits than its factorization.
20021110121221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10450.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20021110121221 its reverse (12212101112002), we get a palindrome (32233211233223).
The spelling of 20021110121221 in words is "twenty trillion, twenty-one billion, one hundred ten million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •