Base | Representation |
---|---|
bin | 11110100101110100111… |
… | …001010110111110001101 |
3 | 21102222010221112222201110 |
4 | 132211310321112332031 |
5 | 233420301222413401 |
6 | 4245423142002233 |
7 | 304610323611030 |
oct | 36456471267615 |
9 | 7388127488643 |
10 | 2102200201101 |
11 | 7405a1233600 |
12 | 29b506716379 |
13 | 12330cb45b50 |
14 | 73a65c01017 |
15 | 39a3a4739d6 |
hex | 1e974e56f8d |
2102200201101 has 96 divisors (see below), whose sum is σ = 3792855032064. Its totient is φ = 1007791488000.
The previous prime is 2102200201007. The next prime is 2102200201133. The reversal of 2102200201101 is 1011020022012.
It is not a de Polignac number, because 2102200201101 - 211 = 2102200199053 is a prime.
It is a super-2 number, since 2×21022002011012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102200201201) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 221349385 + ... + 221358881.
It is an arithmetic number, because the mean of its divisors is an integer number (39508906584).
Almost surely, 22102200201101 is an apocalyptic number.
2102200201101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2102200201101 is a deficient number, since it is larger than the sum of its proper divisors (1690654830963).
2102200201101 is a wasteful number, since it uses less digits than its factorization.
2102200201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16243 (or 16232 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2102200201101 its reverse (1011020022012), we get a palindrome (3113220223113).
The spelling of 2102200201101 in words is "two trillion, one hundred two billion, two hundred million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •