Base | Representation |
---|---|
bin | 101111110010111110010101… |
… | …111101001001000100000101 |
3 | 1000120021222121000010122100221 |
4 | 233302332111331021010011 |
5 | 210023044313122414341 |
6 | 2023025351332304341 |
7 | 62164152012042610 |
oct | 5762762575110405 |
9 | 1016258530118327 |
10 | 210211100201221 |
11 | 60a86032964a89 |
12 | 1b6b03a01720b1 |
13 | 903aa8b345172 |
14 | 39ca3b3149177 |
15 | 1948116bd9ed1 |
hex | bf2f95f49105 |
210211100201221 has 16 divisors (see below), whose sum is σ = 250763593238784. Its totient is φ = 172294007618304.
The previous prime is 210211100201209. The next prime is 210211100201257. The reversal of 210211100201221 is 122102001112012.
It is a cyclic number.
It is not a de Polignac number, because 210211100201221 - 233 = 210202510266629 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210211100201195 and 210211100201204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210211100201261) 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, 200161636 + ... + 201209101.
It is an arithmetic number, because the mean of its divisors is an integer number (15672724577424).
Almost surely, 2210211100201221 is an apocalyptic number.
It is an amenable number.
210211100201221 is a deficient number, since it is larger than the sum of its proper divisors (40552493037563).
210211100201221 is a wasteful number, since it uses less digits than its factorization.
210211100201221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 401374020.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 210211100201221 its reverse (122102001112012), we get a palindrome (332313101313233).
The spelling of 210211100201221 in words is "two hundred ten trillion, two hundred eleven billion, one hundred million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •