Base | Representation |
---|---|
bin | 1001000110101100001110… |
… | …01101110110100001010001 |
3 | 2121212222222122202121202012 |
4 | 10203112013031312201101 |
5 | 10111011213421401001 |
6 | 110325323234432305 |
7 | 4134322540423343 |
oct | 443260715664121 |
9 | 77788878677665 |
10 | 20021111122001 |
11 | 64199a6308500 |
12 | 22b4285732695 |
13 | b22ca0c347c2 |
14 | 4d3053d39293 |
15 | 24abdd4332bb |
hex | 123587376851 |
20021111122001 has 24 divisors (see below), whose sum is σ = 22122271920672. Its totient is φ = 18105417792000.
The previous prime is 20021111121937. The next prime is 20021111122009. The reversal of 20021111122001 is 10022111112002.
It is not a de Polignac number, because 20021111122001 - 26 = 20021111121937 is a prime.
It is a super-2 number, since 2×200211111220012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20021111122009) 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, 515311226 + ... + 515350076.
It is an arithmetic number, because the mean of its divisors is an integer number (921761330028).
Almost surely, 220021111122001 is an apocalyptic number.
It is an amenable number.
20021111122001 is a deficient number, since it is larger than the sum of its proper divisors (2101160798671).
20021111122001 is a wasteful number, since it uses less digits than its factorization.
20021111122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61133 (or 61122 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20021111122001 its reverse (10022111112002), we get a palindrome (30043222234003).
Subtracting from 20021111122001 its reverse (10022111112002), we obtain a palindrome (9999000009999).
The spelling of 20021111122001 in words is "twenty trillion, twenty-one billion, one hundred eleven million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •