Base | Representation |
---|---|
bin | 1010001100101000110000… |
… | …0011010100010000100011 |
3 | 1110200212200111100012221221 |
4 | 2203022030003110100203 |
5 | 2432200103331302321 |
6 | 35502453052555511 |
7 | 2235025060152220 |
oct | 243121403242043 |
9 | 43625614305857 |
10 | 11212214322211 |
11 | 3633089757181 |
12 | 1311003a82b97 |
13 | 6343cc108006 |
14 | 2aa961904947 |
15 | 1469c70d6e41 |
hex | a328c0d4423 |
11212214322211 has 8 divisors (see below), whose sum is σ = 12843689992704. Its totient is φ = 9588171343560.
The previous prime is 11212214322209. The next prime is 11212214322229. The reversal of 11212214322211 is 11222341221211.
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 11212214322211 - 21 = 11212214322209 is a prime.
It is a super-3 number, since 3×112122143222113 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11212214362211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1858169725 + ... + 1858175758.
It is an arithmetic number, because the mean of its divisors is an integer number (1605461249088).
Almost surely, 211212214322211 is an apocalyptic number.
11212214322211 is a deficient number, since it is larger than the sum of its proper divisors (1631475670493).
11212214322211 is an equidigital number, since it uses as much as digits as its factorization.
11212214322211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3716345921.
The product of its digits is 768, while the sum is 25.
Adding to 11212214322211 its reverse (11222341221211), we get a palindrome (22434555543422).
The spelling of 11212214322211 in words is "eleven trillion, two hundred twelve billion, two hundred fourteen million, three hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •