Base | Representation |
---|---|
bin | 1001010010010111000001… |
… | …0110000101101011011001 |
3 | 1100011011102200112200201111 |
4 | 2110211300112011223121 |
5 | 2314244133124214314 |
6 | 33414513453020321 |
7 | 2102502434534206 |
oct | 224456026055331 |
9 | 40134380480644 |
10 | 10211022101209 |
11 | 3287519858a76 |
12 | 118ab6a7846a1 |
13 | 590b83b3c977 |
14 | 274304dd4cad |
15 | 12a92ad6eec4 |
hex | 94970585ad9 |
10211022101209 has 2 divisors, whose sum is σ = 10211022101210. Its totient is φ = 10211022101208.
The previous prime is 10211022101179. The next prime is 10211022101221. The reversal of 10211022101209 is 90210122011201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6964701021184 + 3246321080025 = 2639072^2 + 1801755^2 .
It is a cyclic number.
It is not a de Polignac number, because 10211022101209 - 25 = 10211022101177 is a prime.
It is a super-2 number, since 2×102110221012092 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10211022101209.
It is not a weakly prime, because it can be changed into another prime (10211022101809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105511050604 + 5105511050605.
It is an arithmetic number, because the mean of its divisors is an integer number (5105511050605).
Almost surely, 210211022101209 is an apocalyptic number.
It is an amenable number.
10211022101209 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211022101209 is an equidigital number, since it uses as much as digits as its factorization.
10211022101209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 10211022101209 in words is "ten trillion, two hundred eleven billion, twenty-two million, one hundred one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •