Base | Representation |
---|---|
bin | 110000000000001110110001… |
… | …110001101010001111101001 |
3 | 1000200112002001011000102112020 |
4 | 300000032301301222033221 |
5 | 210133011030101121301 |
6 | 2025004053120135053 |
7 | 62320032310533336 |
oct | 6000166161521751 |
9 | 1020462034012466 |
10 | 211122100020201 |
11 | 612a741a579667 |
12 | 1b818a64167489 |
13 | 90a59619943a6 |
14 | 3a1c51539598d |
15 | 1961b84c6c436 |
hex | c003b1c6a3e9 |
211122100020201 has 8 divisors (see below), whose sum is σ = 281497809893664. Its totient is φ = 140747228413440.
The previous prime is 211122100020163. The next prime is 211122100020203. The reversal of 211122100020201 is 102020001221112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211122100020201 - 214 = 211122100003817 is a prime.
It is a super-2 number, since 2×2111221000202012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211122100020203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 208978776 + ... + 209986601.
It is an arithmetic number, because the mean of its divisors is an integer number (35187226236708).
Almost surely, 2211122100020201 is an apocalyptic number.
It is an amenable number.
211122100020201 is a deficient number, since it is larger than the sum of its proper divisors (70375709873463).
211122100020201 is a wasteful number, since it uses less digits than its factorization.
211122100020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419133351.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211122100020201 its reverse (102020001221112), we get a palindrome (313142101241313).
The spelling of 211122100020201 in words is "two hundred eleven trillion, one hundred twenty-two billion, one hundred million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •