Base | Representation |
---|---|
bin | 1001000110101110000101… |
… | …10000010100001001110110 |
3 | 2121220002120021100111020220 |
4 | 10203113002300110021312 |
5 | 10111020240130341042 |
6 | 110330010320235210 |
7 | 4134356360022216 |
oct | 443270260241166 |
9 | 77802507314226 |
10 | 20022110012022 |
11 | 641a369143348 |
12 | 22b450416bb06 |
13 | b230ccb736a1 |
14 | 4d310a878246 |
15 | 24ac4ae958ec |
hex | 1235c2c14276 |
20022110012022 has 16 divisors (see below), whose sum is σ = 40641894950592. Its totient is φ = 6574424182920.
The previous prime is 20022110011993. The next prime is 20022110012161. The reversal of 20022110012022 is 22021001122002.
It is a super-2 number, since 2×200221100120222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20022110011992 and 20022110012010.
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 7 ways as a sum of consecutive naturals, for example, 24903121504 + ... + 24903122307.
It is an arithmetic number, because the mean of its divisors is an integer number (2540118434412).
Almost surely, 220022110012022 is an apocalyptic number.
20022110012022 is an abundant number, since it is smaller than the sum of its proper divisors (20619784938570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022110012022 is a wasteful number, since it uses less digits than its factorization.
20022110012022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49806243883.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20022110012022 its reverse (22021001122002), we get a palindrome (42043111134024).
The spelling of 20022110012022 in words is "twenty trillion, twenty-two billion, one hundred ten million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •