Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …01000010111001100100110 |
3 | 2121220002210120001121200021 |
4 | 10203113020020113030212 |
5 | 10111020431222431042 |
6 | 110330023301305354 |
7 | 4134361533435634 |
oct | 443271010271446 |
9 | 77802716047607 |
10 | 20022200202022 |
11 | 641a405044437 |
12 | 22b452a40525a |
13 | b23115760c55 |
14 | 4d3118834354 |
15 | 24ac53d5d867 |
hex | 1235c8217326 |
20022200202022 has 8 divisors (see below), whose sum is σ = 30542339291400. Its totient is φ = 9841420438224.
The previous prime is 20022200201947. The next prime is 20022200202049. The reversal of 20022200202022 is 22020200222002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×200222002020222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20022200201987 and 20022200202005.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 84839831247 + ... + 84839831482.
It is an arithmetic number, because the mean of its divisors is an integer number (3817792411425).
Almost surely, 220022200202022 is an apocalyptic number.
20022200202022 is a deficient number, since it is larger than the sum of its proper divisors (10520139089378).
20022200202022 is a wasteful number, since it uses less digits than its factorization.
20022200202022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169679662790.
The product of its (nonzero) digits is 256, while the sum is 16.
Adding to 20022200202022 its reverse (22020200222002), we get a palindrome (42042400424024).
The spelling of 20022200202022 in words is "twenty trillion, twenty-two billion, two hundred million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •