Base | Representation |
---|---|
bin | 101111110001100000010111… |
… | …110110010000101000111101 |
3 | 1000112221100011010000112021121 |
4 | 233301200113312100220331 |
5 | 210014421142224021341 |
6 | 2022511143215430541 |
7 | 62153650426255030 |
oct | 5761402766205075 |
9 | 1015840133015247 |
10 | 210110200220221 |
11 | 60a4726550a934 |
12 | 1b694920b25451 |
13 | 90313cb2478b2 |
14 | 39c5560775017 |
15 | 19456ad9794d1 |
hex | bf1817d90a3d |
210110200220221 has 32 divisors (see below), whose sum is σ = 245885290979328. Its totient is φ = 175824657650880.
The previous prime is 210110200220161. The next prime is 210110200220237. The reversal of 210110200220221 is 122022002011012.
It is a happy number.
It is not a de Polignac number, because 210110200220221 - 27 = 210110200220093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210110200220195 and 210110200220204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210110200220821) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1057660315 + ... + 1057858951.
It is an arithmetic number, because the mean of its divisors is an integer number (7683915343104).
Almost surely, 2210110200220221 is an apocalyptic number.
It is an amenable number.
210110200220221 is a deficient number, since it is larger than the sum of its proper divisors (35775090759107).
210110200220221 is a wasteful number, since it uses less digits than its factorization.
210110200220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219481.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 210110200220221 its reverse (122022002011012), we get a palindrome (332132202231233).
The spelling of 210110200220221 in words is "two hundred ten trillion, one hundred ten billion, two hundred million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •