Base | Representation |
---|---|
bin | 101111110011000111101010… |
… | …101101001010110110110001 |
3 | 1000120022221102202010100010022 |
4 | 233303013222231022312301 |
5 | 210023230314133342314 |
6 | 2023034125020213225 |
7 | 62164655062036124 |
oct | 5763075255126661 |
9 | 1016287382110108 |
10 | 210221112012209 |
11 | 60a8a300306841 |
12 | 1b6b231509a215 |
13 | 903b9c560958c |
14 | 39caa82aa43bb |
15 | 1948500b2c78e |
hex | bf31eab4adb1 |
210221112012209 has 4 divisors (see below), whose sum is σ = 210221265007104. Its totient is φ = 210220959017316.
The previous prime is 210221112012203. The next prime is 210221112012227. The reversal of 210221112012209 is 902210211122012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210221112012209 is a prime.
It is a super-2 number, since 2×2102211120122092 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210221112012203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 74417537 + ... + 77190750.
It is an arithmetic number, because the mean of its divisors is an integer number (52555316251776).
Almost surely, 2210221112012209 is an apocalyptic number.
It is an amenable number.
210221112012209 is a deficient number, since it is larger than the sum of its proper divisors (152994895).
210221112012209 is a wasteful number, since it uses less digits than its factorization.
210221112012209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152994894.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 210221112012209 in words is "two hundred ten trillion, two hundred twenty-one billion, one hundred twelve million, twelve thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •