Base | Representation |
---|---|
bin | 1010000000111000000001… |
… | …10101010011111110000110 |
3 | 2212222010021100121101222002 |
4 | 11000130000311103332012 |
5 | 10341240044143131042 |
6 | 114455554044505302 |
7 | 4431625561524635 |
oct | 500340065237606 |
9 | 85863240541862 |
10 | 22020311302022 |
11 | 701a841730740 |
12 | 257782584b232 |
13 | c39677879bc7 |
14 | 561b084a951c |
15 | 282beb0c2132 |
hex | 140700d53f86 |
22020311302022 has 32 divisors (see below), whose sum is σ = 37936041396480. Its totient is φ = 9480851059680.
The previous prime is 22020311302021. The next prime is 22020311302081.
It is a happy number.
22020311302022 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 22020311301985 and 22020311302003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22020311302021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1873973 + ... + 6895824.
It is an arithmetic number, because the mean of its divisors is an integer number (1185501293640).
Almost surely, 222020311302022 is an apocalyptic number.
22020311302022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22020311302022 is a deficient number, since it is larger than the sum of its proper divisors (15915730094458).
22020311302022 is a wasteful number, since it uses less digits than its factorization.
22020311302022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8775836.
The product of its (nonzero) digits is 576, while the sum is 20.
It can be divided in two parts, 2202031 and 1302022, that added together give a palindrome (3504053).
The spelling of 22020311302022 in words is "twenty-two trillion, twenty billion, three hundred eleven million, three hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •