Base | Representation |
---|---|
bin | 101111111111111010011001… |
… | …000010101010100100110001 |
3 | 1000200102222112121110220120121 |
4 | 233333322121002222210301 |
5 | 210132131212303223441 |
6 | 2024550033041410241 |
7 | 62315326000323100 |
oct | 5777723102524461 |
9 | 1020388477426517 |
10 | 211100210211121 |
11 | 61299107325060 |
12 | 1b814775339981 |
13 | 90a388391363a |
14 | 3a1b43a0da037 |
15 | 1961303157dd1 |
hex | bffe990aa931 |
211100210211121 has 24 divisors (see below), whose sum is σ = 267915654470880. Its totient is φ = 164477728195200.
The previous prime is 211100210211097. The next prime is 211100210211151. The reversal of 211100210211121 is 121112012001112.
It is not a de Polignac number, because 211100210211121 - 29 = 211100210210609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211100210211095 and 211100210211104.
It is not an unprimeable number, because it can be changed into a prime (211100210211151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13410511 + ... + 24536548.
It is an arithmetic number, because the mean of its divisors is an integer number (11163152269620).
Almost surely, 2211100210211121 is an apocalyptic number.
It is an amenable number.
211100210211121 is a deficient number, since it is larger than the sum of its proper divisors (56815444259759).
211100210211121 is a wasteful number, since it uses less digits than its factorization.
211100210211121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37957405 (or 37957398 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 211100210211121 its reverse (121112012001112), we get a palindrome (332212222212233).
The spelling of 211100210211121 in words is "two hundred eleven trillion, one hundred billion, two hundred ten million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •