Base | Representation |
---|---|
bin | 1010001100101000110001… |
… | …1101101000110001110001 |
3 | 1110200212200222022202200201 |
4 | 2203022030131220301301 |
5 | 2432200112113101001 |
6 | 35502453500515201 |
7 | 2235025202620222 |
oct | 243121435506161 |
9 | 43625628282621 |
10 | 11212221222001 |
11 | 363309263a088 |
12 | 131100624bb01 |
13 | 634400682727 |
14 | 2aa9627bd249 |
15 | 1469c79eb501 |
hex | a328c768c71 |
11212221222001 has 8 divisors (see below), whose sum is σ = 11439146709504. Its totient is φ = 10987048055280.
The previous prime is 11212221221953. The next prime is 11212221222017. The reversal of 11212221222001 is 10022212221211.
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 11212221222001 - 29 = 11212221221489 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11212221222001.
It is not an unprimeable number, because it can be changed into a prime (11212221222101) 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, 438067270 + ... + 438092863.
It is an arithmetic number, because the mean of its divisors is an integer number (1429893338688).
Almost surely, 211212221222001 is an apocalyptic number.
It is an amenable number.
11212221222001 is a deficient number, since it is larger than the sum of its proper divisors (226925487503).
11212221222001 is an equidigital number, since it uses as much as digits as its factorization.
11212221222001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 876160391.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11212221222001 its reverse (10022212221211), we get a palindrome (21234433443212).
The spelling of 11212221222001 in words is "eleven trillion, two hundred twelve billion, two hundred twenty-one million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •