Base | Representation |
---|---|
bin | 1010000001100000101000… |
… | …01101000010001000110110 |
3 | 2220001012112121211002211220 |
4 | 11000300110031002020312 |
5 | 10342114220421432042 |
6 | 114514001150411210 |
7 | 4433330030125203 |
oct | 500602415021066 |
9 | 86035477732756 |
10 | 22042111124022 |
11 | 7029009102660 |
12 | 257baaa500b06 |
13 | c3b7400b1872 |
14 | 562bb581ccaa |
15 | 283574d5d8ec |
hex | 140c14342236 |
22042111124022 has 32 divisors (see below), whose sum is σ = 48558790275840. Its totient is φ = 6614578799520.
The previous prime is 22042111123993. The next prime is 22042111124027.
22042111124022 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 22042111123983 and 22042111124001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22042111124027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1621213497 + ... + 1621227092.
It is an arithmetic number, because the mean of its divisors is an integer number (1517462196120).
Almost surely, 222042111124022 is an apocalyptic number.
22042111124022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22042111124022 is an abundant number, since it is smaller than the sum of its proper divisors (26516679151818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22042111124022 is a wasteful number, since it uses less digits than its factorization.
22042111124022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3242440708.
The product of its (nonzero) digits is 1024, while the sum is 24.
It can be divided in two parts, 2204211 and 1124022, that added together give a palindrome (3328233).
The spelling of 22042111124022 in words is "twenty-two trillion, forty-two billion, one hundred eleven million, one hundred twenty-four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •