Base | Representation |
---|---|
bin | 10001101000111100110… |
… | …100001110101110001110 |
3 | 11021212220101020022201100 |
4 | 101220330310032232032 |
5 | 124330041440232342 |
6 | 2324513312323530 |
7 | 153402321234435 |
oct | 21507464165616 |
9 | 4255811208640 |
10 | 1212201102222 |
11 | 428100a13850 |
12 | 176b238435a6 |
13 | 8a405301416 |
14 | 42956b3411c |
15 | 217eae31e4c |
hex | 11a3cd0eb8e |
1212201102222 has 96 divisors (see below), whose sum is σ = 3029766405120. Its totient is φ = 346813776000.
The previous prime is 1212201102157. The next prime is 1212201102317. The reversal of 1212201102222 is 2222011022121.
It is a happy number.
1212201102222 is a `hidden beast` number, since 121 + 220 + 1 + 102 + 222 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1212201102195 and 1212201102204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2156772 + ... + 2660087.
It is an arithmetic number, because the mean of its divisors is an integer number (31560066720).
Almost surely, 21212201102222 is an apocalyptic number.
1212201102222 is an abundant number, since it is smaller than the sum of its proper divisors (1817565302898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1212201102222 is a wasteful number, since it uses less digits than its factorization.
1212201102222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4816950 (or 4816947 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1212201102222 its reverse (2222011022121), we get a palindrome (3434212124343).
The spelling of 1212201102222 in words is "one trillion, two hundred twelve billion, two hundred one million, one hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •