Base | Representation |
---|---|
bin | 1001000110101110000101… |
… | …10000101001111010000010 |
3 | 2121220002120021112000110220 |
4 | 10203113002300221322002 |
5 | 10111020240141213442 |
6 | 110330010322203510 |
7 | 4134356360543043 |
oct | 443270260517202 |
9 | 77802507460426 |
10 | 20022110101122 |
11 | 641a3691a4288 |
12 | 22b45041b3596 |
13 | b230ccba50cc |
14 | 4d310a89c8ca |
15 | 24ac4aeb1eec |
hex | 1235c2c29e82 |
20022110101122 has 8 divisors (see below), whose sum is σ = 40044220202256. Its totient is φ = 6674036700372.
The previous prime is 20022110101099. The next prime is 20022110101129. The reversal of 20022110101122 is 22110101122002.
It is a sphenic number, since it is the product of 3 distinct primes.
20022110101122 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (20022110101129) 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 3 ways as a sum of consecutive naturals, for example, 1668509175088 + ... + 1668509175099.
It is an arithmetic number, because the mean of its divisors is an integer number (5005527525282).
Almost surely, 220022110101122 is an apocalyptic number.
20022110101122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022110101122 is a wasteful number, since it uses less digits than its factorization.
20022110101122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3337018350192.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20022110101122 its reverse (22110101122002), we get a palindrome (42132211223124).
The spelling of 20022110101122 in words is "twenty trillion, twenty-two billion, one hundred ten million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •