Base | Representation |
---|---|
bin | 110010100000010011010110… |
… | …001000000010010111101110 |
3 | 1002010110200000112100122000011 |
4 | 302200103112020002113232 |
5 | 213103222101001023042 |
6 | 2104225254351523434 |
7 | 64533536141221156 |
oct | 6240232610022756 |
9 | 1063420015318004 |
10 | 222122121111022 |
11 | 6485850a723400 |
12 | 20ab4908b2957a |
13 | 96c3045591202 |
14 | 3cbcaa765b766 |
15 | 1aa2d8d1e0a17 |
hex | ca04d62025ee |
222122121111022 has 48 divisors (see below), whose sum is σ = 369345979094400. Its totient is φ = 100106928236480.
The previous prime is 222122121111019. The next prime is 222122121111109. The reversal of 222122121111022 is 220111121221222.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 222122121110984 and 222122121111002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14554563 + ... + 25614049.
It is an arithmetic number, because the mean of its divisors is an integer number (7694707897800).
Almost surely, 2222122121111022 is an apocalyptic number.
222122121111022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
222122121111022 is a deficient number, since it is larger than the sum of its proper divisors (147223857983378).
222122121111022 is a wasteful number, since it uses less digits than its factorization.
222122121111022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11060217 (or 11060206 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 222122121111022 its reverse (220111121221222), we get a palindrome (442233242332244).
The spelling of 222122121111022 in words is "two hundred twenty-two trillion, one hundred twenty-two billion, one hundred twenty-one million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •