Base | Representation |
---|---|
bin | 1010001101001101111111… |
… | …0110001011111111100101 |
3 | 1110201211111010011101222100 |
4 | 2203103133312023333211 |
5 | 2432331041241214341 |
6 | 35511225005122313 |
7 | 2235530553654120 |
oct | 243233766137745 |
9 | 43654433141870 |
10 | 11222210101221 |
11 | 3637349048969 |
12 | 1312b33559399 |
13 | 635332c78152 |
14 | 2ab22d2893b7 |
15 | 146dae90e3b6 |
hex | a34dfd8bfe5 |
11222210101221 has 12 divisors (see below), whose sum is σ = 18525553183072. Its totient is φ = 6412691486376.
The previous prime is 11222210101181. The next prime is 11222210101237. The reversal of 11222210101221 is 12210101222211.
11222210101221 is a `hidden beast` number, since 1 + 1 + 222 + 210 + 10 + 1 + 221 = 666.
It is not a de Polignac number, because 11222210101221 - 227 = 11222075883493 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11222210101194 and 11222210101203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11222210101621) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 89065159471 + ... + 89065159596.
Almost surely, 211222210101221 is an apocalyptic number.
It is an amenable number.
11222210101221 is a deficient number, since it is larger than the sum of its proper divisors (7303343081851).
11222210101221 is a wasteful number, since it uses less digits than its factorization.
11222210101221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178130319080 (or 178130319077 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11222210101221 its reverse (12210101222211), we get a palindrome (23432311323432).
The spelling of 11222210101221 in words is "eleven trillion, two hundred twenty-two billion, two hundred ten million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •