Base | Representation |
---|---|
bin | 1001001000111111100011… |
… | …11100010101000110010101 |
3 | 2122011120011021022221112210 |
4 | 10210133301330111012111 |
5 | 10113310213020231401 |
6 | 110425524241504033 |
7 | 4143122653234254 |
oct | 444376174250625 |
9 | 78146137287483 |
10 | 20100211102101 |
11 | 644a4a7179289 |
12 | 2307680042019 |
13 | b2a598766b60 |
14 | 4d6bd935079b |
15 | 24ccbc8be4d6 |
hex | 1247f1f15195 |
20100211102101 has 32 divisors (see below), whose sum is σ = 30524871354880. Its totient is φ = 11662804440000.
The previous prime is 20100211102087. The next prime is 20100211102277. The reversal of 20100211102101 is 10120111200102.
It is not a de Polignac number, because 20100211102101 - 27 = 20100211101973 is a prime.
It is a super-2 number, since 2×201002111021012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100211107101) 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 31 ways as a sum of consecutive naturals, for example, 64122775 + ... + 64435476.
It is an arithmetic number, because the mean of its divisors is an integer number (953902229840).
Almost surely, 220100211102101 is an apocalyptic number.
It is an amenable number.
20100211102101 is a deficient number, since it is larger than the sum of its proper divisors (10424660252779).
20100211102101 is a wasteful number, since it uses less digits than its factorization.
20100211102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128558497.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20100211102101 its reverse (10120111200102), we get a palindrome (30220322302203).
The spelling of 20100211102101 in words is "twenty trillion, one hundred billion, two hundred eleven million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •