Base | Representation |
---|---|
bin | 1010000011011111011110… |
… | …10010010010101001010110 |
3 | 2220021201022122011112020201 |
4 | 11001233233102102221112 |
5 | 10344223203033101402 |
6 | 115005142452051114 |
7 | 4441260434324203 |
oct | 501575722225126 |
9 | 86251278145221 |
10 | 22110211222102 |
11 | 7054984906253 |
12 | 2591135003a9a |
13 | c44ca3a2b1a3 |
14 | 5661d5d94caa |
15 | 28520d780687 |
hex | 141bef492a56 |
22110211222102 has 4 divisors (see below), whose sum is σ = 33165316833156. Its totient is φ = 11055105611050.
The previous prime is 22110211222093. The next prime is 22110211222153. The reversal of 22110211222102 is 20122211201122.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×221102112221022 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22110211222102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5527552805524 + ... + 5527552805527.
It is an arithmetic number, because the mean of its divisors is an integer number (8291329208289).
Almost surely, 222110211222102 is an apocalyptic number.
22110211222102 is a deficient number, since it is larger than the sum of its proper divisors (11055105611054).
22110211222102 is a wasteful number, since it uses less digits than its factorization.
22110211222102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11055105611053.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 22110211222102 its reverse (20122211201122), we get a palindrome (42232422423224).
The spelling of 22110211222102 in words is "twenty-two trillion, one hundred ten billion, two hundred eleven million, two hundred twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •