Base | Representation |
---|---|
bin | 1100010010011111001… |
… | …1001010011101011000 |
3 | 202011221101122011122221 |
4 | 3010213303022131120 |
5 | 11424334001333422 |
6 | 240553202153424 |
7 | 21152530630426 |
oct | 3044763123530 |
9 | 664841564587 |
10 | 211121121112 |
11 | 81599407090 |
12 | 34b00052874 |
13 | 16ba7373b05 |
14 | a30b0c0116 |
15 | 575998b3c7 |
hex | 3127cca758 |
211121121112 has 32 divisors (see below), whose sum is σ = 431885837520. Its totient is φ = 95953661440.
The previous prime is 211121121011. The next prime is 211121121161.
211121121112 is nontrivially palindromic in base 10.
211121121112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 709428 + ... + 962044.
Almost surely, 2211121121112 is an apocalyptic number.
211121121112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
211121121112 is an abundant number, since it is smaller than the sum of its proper divisors (220764716408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211121121112 is a wasteful number, since it uses less digits than its factorization.
211121121112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262131 (or 262127 counting only the distinct ones).
The product of its digits is 16, while the sum is 16.
It can be divided in two parts, 211121 and 121112, that added together give a palindrome (332233).
The spelling of 211121121112 in words is "two hundred eleven billion, one hundred twenty-one million, one hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •