Base | Representation |
---|---|
bin | 1001000110101101111000… |
… | …01101000101000110000001 |
3 | 2121220002021121112222202202 |
4 | 10203112330031011012001 |
5 | 10111020024012041001 |
6 | 110325551352522545 |
7 | 4134353553625046 |
oct | 443267415050601 |
9 | 77802247488682 |
10 | 20022000112001 |
11 | 641a3120aa888 |
12 | 22b44933b0455 |
13 | b230b31749a4 |
14 | 4d30da02b1cd |
15 | 24ac414d796b |
hex | 1235bc345181 |
20022000112001 has 32 divisors (see below), whose sum is σ = 21826359152640. Its totient is φ = 18304198798464.
The previous prime is 20022000111923. The next prime is 20022000112021. The reversal of 20022000112001 is 10021100022002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20022000112001 - 210 = 20022000110977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20022000112021) 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 31 ways as a sum of consecutive naturals, for example, 200927876 + ... + 201027498.
It is an arithmetic number, because the mean of its divisors is an integer number (682073723520).
Almost surely, 220022000112001 is an apocalyptic number.
It is an amenable number.
20022000112001 is a deficient number, since it is larger than the sum of its proper divisors (1804359040639).
20022000112001 is a wasteful number, since it uses less digits than its factorization.
20022000112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102845.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 20022000112001 its reverse (10021100022002), we get a palindrome (30043100134003).
It can be divided in two parts, 200220001 and 12001, that added together give a palindrome (200232002).
The spelling of 20022000112001 in words is "twenty trillion, twenty-two billion, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •