Base | Representation |
---|---|
bin | 101101101110101011110011… |
… | …010101011111110000101111 |
3 | 222101002220110000021012020122 |
4 | 231232223303111133300233 |
5 | 202330123203100213403 |
6 | 1551425204251235155 |
7 | 60235312365466553 |
oct | 5556536325376057 |
9 | 871086400235218 |
10 | 201120221101103 |
11 | 590a0674688947 |
12 | 1a682543148abb |
13 | 882b72b4a6725 |
14 | 37943b08c9863 |
15 | 183b8e9dd2838 |
hex | b6eaf355fc2f |
201120221101103 has 16 divisors (see below), whose sum is σ = 209276450482176. Its totient is φ = 193125593899680.
The previous prime is 201120221101057. The next prime is 201120221101147. The reversal of 201120221101103 is 301101122021102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 201120221101103 - 26 = 201120221101039 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201120221101193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 457055450 + ... + 457495272.
It is an arithmetic number, because the mean of its divisors is an integer number (13079778155136).
Almost surely, 2201120221101103 is an apocalyptic number.
201120221101103 is a deficient number, since it is larger than the sum of its proper divisors (8156229381073).
201120221101103 is a wasteful number, since it uses less digits than its factorization.
201120221101103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 623494.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 201120221101103 its reverse (301101122021102), we get a palindrome (502221343122205).
The spelling of 201120221101103 in words is "two hundred one trillion, one hundred twenty billion, two hundred twenty-one million, one hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •