Base | Representation |
---|---|
bin | 1001000110101110000101… |
… | …10100001010011111011110 |
3 | 2121220002120100020202100021 |
4 | 10203113002310022133132 |
5 | 10111020240410133042 |
6 | 110330010354022354 |
7 | 4134356401424005 |
oct | 443270264123736 |
9 | 77802510222307 |
10 | 20022111021022 |
11 | 641a369772430 |
12 | 22b45045779ba |
13 | b23100137a26 |
14 | 4d310aa5bc3c |
15 | 24ac4b0e4867 |
hex | 1235c2d0a7de |
20022111021022 has 8 divisors (see below), whose sum is σ = 32763454398072. Its totient is φ = 9100959555000.
The previous prime is 20022111021007. The next prime is 20022111021113. The reversal of 20022111021022 is 22012011122002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 20022111020987 and 20022111021005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 455047977729 + ... + 455047977772.
It is an arithmetic number, because the mean of its divisors is an integer number (4095431799759).
Almost surely, 220022111021022 is an apocalyptic number.
20022111021022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20022111021022 is a deficient number, since it is larger than the sum of its proper divisors (12741343377050).
20022111021022 is a wasteful number, since it uses less digits than its factorization.
20022111021022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 910095955514.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20022111021022 its reverse (22012011122002), we get a palindrome (42034122143024).
The spelling of 20022111021022 in words is "twenty trillion, twenty-two billion, one hundred eleven million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •