Base | Representation |
---|---|
bin | 101101111100111110010111… |
… | …000010110110101010101110 |
3 | 222111120210011012212011120101 |
4 | 231330332113002312222232 |
5 | 202442220321334033402 |
6 | 1553500251144341314 |
7 | 60366255264340105 |
oct | 5574762702665256 |
9 | 874523135764511 |
10 | 202102220221102 |
11 | 5943a085580203 |
12 | 1a80092077483a |
13 | 88a02082c4286 |
14 | 37c9b2a35703c |
15 | 1857221169b87 |
hex | b7cf970b6aae |
202102220221102 has 16 divisors (see below), whose sum is σ = 308879514805680. Its totient is φ = 99142459857792.
The previous prime is 202102220221087. The next prime is 202102220221117. The reversal of 202102220221102 is 201122022201202.
It is an interprime number because it is at equal distance from previous prime (202102220221087) and next prime (202102220221117).
It is a self number, because there is not a number n which added to its sum of digits gives 202102220221102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14256828 + ... + 24646735.
It is an arithmetic number, because the mean of its divisors is an integer number (19304969675355).
Almost surely, 2202102220221102 is an apocalyptic number.
202102220221102 is a deficient number, since it is larger than the sum of its proper divisors (106777294584578).
202102220221102 is a wasteful number, since it uses less digits than its factorization.
202102220221102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38952627.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 202102220221102 its reverse (201122022201202), we get a palindrome (403224242422304).
The spelling of 202102220221102 in words is "two hundred two trillion, one hundred two billion, two hundred twenty million, two hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •