Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …01110100101000010100101 |
3 | 2121212220200200221122101220 |
4 | 10203111102032211002211 |
5 | 10111002403330320401 |
6 | 110325055120210553 |
7 | 4134261524142150 |
oct | 443252216450245 |
9 | 77786620848356 |
10 | 20020222120101 |
11 | 641958a508195 |
12 | 22b4077a69a59 |
13 | b22b8b9bc088 |
14 | 4d2dabc42c97 |
15 | 24ab8a37a336 |
hex | 1235523a50a5 |
20020222120101 has 32 divisors (see below), whose sum is σ = 30767983312896. Its totient is φ = 11342550960000.
The previous prime is 20020222120097. The next prime is 20020222120111. The reversal of 20020222120101 is 10102122202002.
It is not a de Polignac number, because 20020222120101 - 22 = 20020222120097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020222120111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4406965 + ... + 7711146.
It is an arithmetic number, because the mean of its divisors is an integer number (961499478528).
Almost surely, 220020222120101 is an apocalyptic number.
20020222120101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20020222120101 is a deficient number, since it is larger than the sum of its proper divisors (10747761192795).
20020222120101 is a wasteful number, since it uses less digits than its factorization.
20020222120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12118793.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20020222120101 its reverse (10102122202002), we get a palindrome (30122344322103).
The spelling of 20020222120101 in words is "twenty trillion, twenty billion, two hundred twenty-two million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •