Base | Representation |
---|---|
bin | 110000000000001110101011… |
… | …110100001010001110110011 |
3 | 1000200112001210011211111100121 |
4 | 300000032223310022032303 |
5 | 210133010324000342321 |
6 | 2025004035144431111 |
7 | 62320026654506011 |
oct | 6000165364121663 |
9 | 1020461704744317 |
10 | 211122000012211 |
11 | 612a7379082132 |
12 | 1b818a36778497 |
13 | 90a594704a072 |
14 | 3a1c505da18b1 |
15 | 1961b7b0b5441 |
hex | c003abd0a3b3 |
211122000012211 has 4 divisors (see below), whose sum is σ = 222233684223400. Its totient is φ = 200010315801024.
The previous prime is 211122000012193. The next prime is 211122000012227. The reversal of 211122000012211 is 112210000221112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211122000012211 - 223 = 211121991623603 is a prime.
It is a super-3 number, since 3×2111220000122113 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211122000010211) 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, 5555842105566 + ... + 5555842105603.
It is an arithmetic number, because the mean of its divisors is an integer number (55558421055850).
Almost surely, 2211122000012211 is an apocalyptic number.
211122000012211 is a deficient number, since it is larger than the sum of its proper divisors (11111684211189).
211122000012211 is a wasteful number, since it uses less digits than its factorization.
211122000012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11111684211188.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 211122000012211 its reverse (112210000221112), we get a palindrome (323332000233323).
The spelling of 211122000012211 in words is "two hundred eleven trillion, one hundred twenty-two billion, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •