Base | Representation |
---|---|
bin | 1001000110101100011011… |
… | …01101001110110000000101 |
3 | 2121220000021020122202101120 |
4 | 10203112031231032300011 |
5 | 10111011424310323023 |
6 | 110325342124344153 |
7 | 4134325332110124 |
oct | 443261555166005 |
9 | 77800236582346 |
10 | 20021220011013 |
11 | 6419a51820421 |
12 | 22b42b60a5059 |
13 | b22cba66b280 |
14 | 4d30645a1abb |
15 | 24abe7c918e3 |
hex | 12358db4ec05 |
20021220011013 has 32 divisors (see below), whose sum is σ = 29473525627392. Its totient is φ = 12010478860800.
The previous prime is 20021220010973. The next prime is 20021220011021. The reversal of 20021220011013 is 31011002212002.
It is not a de Polignac number, because 20021220011013 - 222 = 20021215816709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20021220010983 and 20021220011001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021220011033) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3117370 + ... + 7054107.
It is an arithmetic number, because the mean of its divisors is an integer number (921047675856).
Almost surely, 220021220011013 is an apocalyptic number.
It is an amenable number.
20021220011013 is a deficient number, since it is larger than the sum of its proper divisors (9452305616379).
20021220011013 is a wasteful number, since it uses less digits than its factorization.
20021220011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10172765.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 20021220011013 its reverse (31011002212002), we get a palindrome (51032222223015).
The spelling of 20021220011013 in words is "twenty trillion, twenty-one billion, two hundred twenty million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •