Base | Representation |
---|---|
bin | 1010001101001101111101… |
… | …0100010001110100101001 |
3 | 1110201211110111102210112101 |
4 | 2203103133110101310221 |
5 | 2432331032002242301 |
6 | 35511224050413401 |
7 | 2235530415262450 |
oct | 243233724216451 |
9 | 43654414383471 |
10 | 11222201212201 |
11 | 3637344027471 |
12 | 1312b30591261 |
13 | 635331185185 |
14 | 2ab22c013b97 |
15 | 146dadc55701 |
hex | a34df511d29 |
11222201212201 has 8 divisors (see below), whose sum is σ = 12837599107200. Its totient is φ = 9609859890528.
The previous prime is 11222201212199. The next prime is 11222201212231. The reversal of 11222201212201 is 10221210222211.
11222201212201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11222201212201 - 21 = 11222201212199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11222201212231) 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, 764135461 + ... + 764150146.
It is an arithmetic number, because the mean of its divisors is an integer number (1604699888400).
Almost surely, 211222201212201 is an apocalyptic number.
It is an amenable number.
11222201212201 is a deficient number, since it is larger than the sum of its proper divisors (1615397894999).
11222201212201 is a wasteful number, since it uses less digits than its factorization.
11222201212201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1528286663.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11222201212201 its reverse (10221210222211), we get a palindrome (21443411434412).
The spelling of 11222201212201 in words is "eleven trillion, two hundred twenty-two billion, two hundred one million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •