Base | Representation |
---|---|
bin | 1001001001010010000001… |
… | …00100100101011000110110 |
3 | 2122012111201212001212220221 |
4 | 10210221000210211120312 |
5 | 10113441011233241042 |
6 | 110434243420244554 |
7 | 4143623345255461 |
oct | 444510044453066 |
9 | 78174655055827 |
10 | 20110120212022 |
11 | 6453721654225 |
12 | 23095866a075a |
13 | b2b4b76801c9 |
14 | 4d74993b42d8 |
15 | 24d19c7c6d67 |
hex | 124a40925636 |
20110120212022 has 8 divisors (see below), whose sum is σ = 31939602689736. Its totient is φ = 9463585982112.
The previous prime is 20110120211999. The next prime is 20110120212023. The reversal of 20110120212022 is 22021202101102.
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 = 20110120211987 and 20110120212005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110120212023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 295737061908 + ... + 295737061975.
It is an arithmetic number, because the mean of its divisors is an integer number (3992450336217).
Almost surely, 220110120212022 is an apocalyptic number.
20110120212022 is a deficient number, since it is larger than the sum of its proper divisors (11829482477714).
20110120212022 is a wasteful number, since it uses less digits than its factorization.
20110120212022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591474123902.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20110120212022 its reverse (22021202101102), we get a palindrome (42131322313124).
The spelling of 20110120212022 in words is "twenty trillion, one hundred ten billion, one hundred twenty million, two hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •