Base | Representation |
---|---|
bin | 1010000000111000000100… |
… | …11100100100011100011111 |
3 | 2212222010100020112121201012 |
4 | 11000130002130210130133 |
5 | 10341240123110322320 |
6 | 114500000453005435 |
7 | 4431626340563204 |
oct | 500340234443437 |
9 | 85863306477635 |
10 | 22020338370335 |
11 | 701a855a39548 |
12 | 257783292387b |
13 | c39680366666 |
14 | 561b0bd13cab |
15 | 282bed66c4c5 |
hex | 14070272471f |
22020338370335 has 8 divisors (see below), whose sum is σ = 26632472234496. Its totient is φ = 17477559902880.
The previous prime is 22020338370287. The next prime is 22020338370337. The reversal of 22020338370335 is 53307383302022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22020338370335 - 224 = 22020321593119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22020338370292 and 22020338370301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22020338370337) 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 7 ways as a sum of consecutive naturals, for example, 17338848476 + ... + 17338849745.
It is an arithmetic number, because the mean of its divisors is an integer number (3329059029312).
Almost surely, 222020338370335 is an apocalyptic number.
22020338370335 is a deficient number, since it is larger than the sum of its proper divisors (4612133864161).
22020338370335 is a wasteful number, since it uses less digits than its factorization.
22020338370335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34677698353.
The product of its (nonzero) digits is 544320, while the sum is 41.
The spelling of 22020338370335 in words is "twenty-two trillion, twenty billion, three hundred thirty-eight million, three hundred seventy thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •