Base | Representation |
---|---|
bin | 1001001011111011011111… |
… | …11111111000110110110110 |
3 | 2122112012121002210210201221 |
4 | 10211331233333320312312 |
5 | 10121433333203241042 |
6 | 110544132323540554 |
7 | 4153324225433425 |
oct | 445755777706666 |
9 | 78465532723657 |
10 | 20201110212022 |
11 | 6489274088a33 |
12 | 232313ab2a75a |
13 | b36c5861aaac |
14 | 4dba4b9792bc |
15 | 250725a0bd67 |
hex | 125f6fff8db6 |
20201110212022 has 4 divisors (see below), whose sum is σ = 30301665318036. Its totient is φ = 10100555106010.
The previous prime is 20201110212007. The next prime is 20201110212037. The reversal of 20201110212022 is 22021201110202.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (20201110212007) and next prime (20201110212037).
It is a junction number, because it is equal to n+sod(n) for n = 20201110211987 and 20201110212005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050277553004 + ... + 5050277553007.
It is an arithmetic number, because the mean of its divisors is an integer number (7575416329509).
Almost surely, 220201110212022 is an apocalyptic number.
20201110212022 is a deficient number, since it is larger than the sum of its proper divisors (10100555106014).
20201110212022 is a wasteful number, since it uses less digits than its factorization.
20201110212022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10100555106013.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20201110212022 its reverse (22021201110202), we get a palindrome (42222311322224).
The spelling of 20201110212022 in words is "twenty trillion, two hundred one billion, one hundred ten million, two hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •