Base | Representation |
---|---|
bin | 1010001100101000101111… |
… | …1011010011000011001111 |
3 | 1110200212200100101102102101 |
4 | 2203022023323103003033 |
5 | 2432200102312020421 |
6 | 35502452535535531 |
7 | 2235025033245520 |
oct | 243121373230317 |
9 | 43625610342371 |
10 | 11212212220111 |
11 | 3633088550901 |
12 | 131100322a5a7 |
13 | 6343cb850276 |
14 | 2aa961518847 |
15 | 1469c6d1e191 |
hex | a328bed30cf |
11212212220111 has 8 divisors (see below), whose sum is σ = 12814008238880. Its totient is φ = 9610429055328.
The previous prime is 11212212220093. The next prime is 11212212220241. The reversal of 11212212220111 is 11102221221211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11212212220111 - 29 = 11212212219599 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11212212220411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1265616 + ... + 4901653.
It is an arithmetic number, because the mean of its divisors is an integer number (1601751029860).
Almost surely, 211212212220111 is an apocalyptic number.
11212212220111 is a deficient number, since it is larger than the sum of its proper divisors (1601796018769).
11212212220111 is an equidigital number, since it uses as much as digits as its factorization.
11212212220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6426993.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 11212212220111 its reverse (11102221221211), we get a palindrome (22314433441322).
The spelling of 11212212220111 in words is "eleven trillion, two hundred twelve billion, two hundred twelve million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •