Base | Representation |
---|---|
bin | 101101101110011010110110… |
… | …100010011101101011101101 |
3 | 222101001011110121222111101221 |
4 | 231232122312202131223231 |
5 | 202324323414413033401 |
6 | 1551412554304503341 |
7 | 60234066362200120 |
oct | 5556326642355355 |
9 | 871034417874357 |
10 | 201102021221101 |
11 | 59093985295700 |
12 | 1a67ab0401ab51 |
13 | 8829abaa31670 |
14 | 379356570c3b7 |
15 | 183b1d21e57a1 |
hex | b6e6b689daed |
201102021221101 has 48 divisors (see below), whose sum is σ = 274750275752064. Its totient is φ = 143216639280000.
The previous prime is 201102021221099. The next prime is 201102021221111. The reversal of 201102021221101 is 101122120201102.
It is not a de Polignac number, because 201102021221101 - 21 = 201102021221099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102021221111) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 89302435 + ... + 91526656.
It is an arithmetic number, because the mean of its divisors is an integer number (5723964078168).
Almost surely, 2201102021221101 is an apocalyptic number.
It is an amenable number.
201102021221101 is a deficient number, since it is larger than the sum of its proper divisors (73648254530963).
201102021221101 is a wasteful number, since it uses less digits than its factorization.
201102021221101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180829234 (or 180829223 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201102021221101 its reverse (101122120201102), we get a palindrome (302224141422203).
The spelling of 201102021221101 in words is "two hundred one trillion, one hundred two billion, twenty-one million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •