Base | Representation |
---|---|
bin | 101111110011000111101111… |
… | …111101101001111111000101 |
3 | 1000120022221122220002202121021 |
4 | 233303013233331221333011 |
5 | 210023231004224020401 |
6 | 2023034141450551141 |
7 | 62164660212556030 |
oct | 5763075775517705 |
9 | 1016287586082537 |
10 | 210221200220101 |
11 | 60a8a346083724 |
12 | 1b6b233a7384b1 |
13 | 903ba0a9818b5 |
14 | 39caa906a6017 |
15 | 19485087532a1 |
hex | bf31eff69fc5 |
210221200220101 has 16 divisors (see below), whose sum is σ = 243787689093888. Its totient is φ = 177541580361600.
The previous prime is 210221200220093. The next prime is 210221200220167. The reversal of 210221200220101 is 101022002122012.
It is a happy number.
It is not a de Polignac number, because 210221200220101 - 23 = 210221200220093 is a prime.
It is a super-3 number, since 3×2102212002201013 (a number of 44 digits) contains 333 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 (210221200221101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 130314360 + ... + 131917681.
It is an arithmetic number, because the mean of its divisors is an integer number (15236730568368).
Almost surely, 2210221200220101 is an apocalyptic number.
It is an amenable number.
210221200220101 is a deficient number, since it is larger than the sum of its proper divisors (33566488873787).
210221200220101 is a wasteful number, since it uses less digits than its factorization.
210221200220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262233732.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 210221200220101 its reverse (101022002122012), we get a palindrome (311243202342113).
The spelling of 210221200220101 in words is "two hundred ten trillion, two hundred twenty-one billion, two hundred million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •