Base | Representation |
---|---|
bin | 1001000110101100001110… |
… | …01010010111111000110101 |
3 | 2121212222222121001021212010 |
4 | 10203112013022113320311 |
5 | 10111011213203210401 |
6 | 110325323203114433 |
7 | 4134322526604630 |
oct | 443260712277065 |
9 | 77788877037763 |
10 | 20021110210101 |
11 | 64199a5845370 |
12 | 22b4285372a19 |
13 | b22ca09a5710 |
14 | 4d3053b7cc17 |
15 | 24abdd302ed6 |
hex | 123587297e35 |
20021110210101 has 128 divisors (see below), whose sum is σ = 36553303019520. Its totient is φ = 9410349312000.
The previous prime is 20021110210081. The next prime is 20021110210111. The reversal of 20021110210101 is 10101201112002.
It is not a de Polignac number, because 20021110210101 - 27 = 20021110209973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021110210111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 167216265 + ... + 167335953.
It is an arithmetic number, because the mean of its divisors is an integer number (285572679840).
Almost surely, 220021110210101 is an apocalyptic number.
20021110210101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20021110210101 is a deficient number, since it is larger than the sum of its proper divisors (16532192809419).
20021110210101 is a wasteful number, since it uses less digits than its factorization.
20021110210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120827.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20021110210101 its reverse (10101201112002), we get a palindrome (30122311322103).
The spelling of 20021110210101 in words is "twenty trillion, twenty-one billion, one hundred ten million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •