Base | Representation |
---|---|
bin | 1001001000111111001100… |
… | …00001110110000001101101 |
3 | 2122011112122100012221100210 |
4 | 10210133212001312001231 |
5 | 10113304310333033401 |
6 | 110425452341413033 |
7 | 4143115005253650 |
oct | 444374601660155 |
9 | 78145570187323 |
10 | 20100011221101 |
11 | 644a404367779 |
12 | 230762510a179 |
13 | b2a566221a86 |
14 | 4d6bba99d897 |
15 | 24ccaa08a4d6 |
hex | 1247e607606d |
20100011221101 has 32 divisors (see below), whose sum is σ = 31198808689920. Its totient is φ = 11273772128256.
The previous prime is 20100011220979. The next prime is 20100011221217. The reversal of 20100011221101 is 10112211000102.
It is not a de Polignac number, because 20100011221101 - 211 = 20100011219053 is a prime.
It is a super-2 number, since 2×201000112211012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100010221101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 38993656 + ... + 39505761.
It is an arithmetic number, because the mean of its divisors is an integer number (974962771560).
Almost surely, 220100011221101 is an apocalyptic number.
20100011221101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20100011221101 is a deficient number, since it is larger than the sum of its proper divisors (11098797468819).
20100011221101 is a wasteful number, since it uses less digits than its factorization.
20100011221101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78499653.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20100011221101 its reverse (10112211000102), we get a palindrome (30212222221203).
The spelling of 20100011221101 in words is "twenty trillion, one hundred billion, eleven million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •