Base | Representation |
---|---|
bin | 101111110001010111110100… |
… | …000101001100010010111101 |
3 | 1000112220110102122102011021020 |
4 | 233301113310011030102331 |
5 | 210014243332104021341 |
6 | 2022503023250054353 |
7 | 62153203615456101 |
oct | 5761276405142275 |
9 | 1015813378364236 |
10 | 210101010220221 |
11 | 60a43379a4690a |
12 | 1b692b9727a3b9 |
13 | 9030595301b83 |
14 | 39c4d2c021901 |
15 | 1945321c6b566 |
hex | bf15f414c4bd |
210101010220221 has 16 divisors (see below), whose sum is σ = 280177861759488. Its totient is φ = 140045750558000.
The previous prime is 210101010220217. The next prime is 210101010220229. The reversal of 210101010220221 is 122022010101012.
It is a cyclic number.
It is not a de Polignac number, because 210101010220221 - 22 = 210101010220217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210101010220221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210101010220229) 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, 865392970 + ... + 865635716.
It is an arithmetic number, because the mean of its divisors is an integer number (17511116359968).
Almost surely, 2210101010220221 is an apocalyptic number.
It is an amenable number.
210101010220221 is a deficient number, since it is larger than the sum of its proper divisors (70076851539267).
210101010220221 is a wasteful number, since it uses less digits than its factorization.
210101010220221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286032.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210101010220221 its reverse (122022010101012), we get a palindrome (332123020321233).
The spelling of 210101010220221 in words is "two hundred ten trillion, one hundred one billion, ten million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •