Base | Representation |
---|---|
bin | 110000000000001111110100… |
… | …000000001110000100011011 |
3 | 1000200112011220120202211000221 |
4 | 300000033310000032010123 |
5 | 210133020314022230321 |
6 | 2025004355251140511 |
7 | 62320101662043016 |
oct | 6000176400160433 |
9 | 1020464816684027 |
10 | 211123211133211 |
11 | 612a793a794283 |
12 | 1b8191142a4737 |
13 | 90a5aaac36400 |
14 | 3a1c5bcb8837d |
15 | 1961bec59ae41 |
hex | c003f400e11b |
211123211133211 has 24 divisors (see below), whose sum is σ = 234167265294336. Its totient is φ = 190157153004000.
The previous prime is 211123211133209. The next prime is 211123211133223. The reversal of 211123211133211 is 112331112321112.
It is not a de Polignac number, because 211123211133211 - 21 = 211123211133209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211123211133511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7633915 + ... + 21920836.
It is an arithmetic number, because the mean of its divisors is an integer number (9756969387264).
Almost surely, 2211123211133211 is an apocalyptic number.
211123211133211 is a deficient number, since it is larger than the sum of its proper divisors (23044054161125).
211123211133211 is a wasteful number, since it uses less digits than its factorization.
211123211133211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29555803 (or 29555790 counting only the distinct ones).
The product of its digits is 432, while the sum is 25.
Adding to 211123211133211 its reverse (112331112321112), we get a palindrome (323454323454323).
The spelling of 211123211133211 in words is "two hundred eleven trillion, one hundred twenty-three billion, two hundred eleven million, one hundred thirty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •