Base | Representation |
---|---|
bin | 1010000011100011001011… |
… | …10101101110000111000010 |
3 | 2220021220110020211010222002 |
4 | 11001301211311232013002 |
5 | 10344241241224033442 |
6 | 115010112103144002 |
7 | 4441360635460154 |
oct | 501614565560702 |
9 | 86256406733862 |
10 | 22112200221122 |
11 | 70558056196a0 |
12 | 25915ab145002 |
13 | c4522cb2319b |
14 | 5663441c8ad4 |
15 | 2852c81bd732 |
hex | 141c65d6e1c2 |
22112200221122 has 96 divisors (see below), whose sum is σ = 42158125235520. Its totient is φ = 8572233922560.
The previous prime is 22112200221121. The next prime is 22112200221161.
22112200221122 is nontrivially palindromic in base 10.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 22112200221094 and 22112200221103.
It is not an unprimeable number, because it can be changed into a prime (22112200221121) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 817898 + ... + 6700250.
It is an arithmetic number, because the mean of its divisors is an integer number (439147137870).
Almost surely, 222112200221122 is an apocalyptic number.
22112200221122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22112200221122 is a deficient number, since it is larger than the sum of its proper divisors (20045925014398).
22112200221122 is a wasteful number, since it uses less digits than its factorization.
22112200221122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5882448 (or 5882425 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
It can be divided in two parts, 22112200 and 221122, that multiplied together give a square (4889493888400 = 22112202).
The spelling of 22112200221122 in words is "twenty-two trillion, one hundred twelve billion, two hundred million, two hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •