Base | Representation |
---|---|
bin | 1001000110000110110011… |
… | …10101000101010001111111 |
3 | 2121211002010122002210102021 |
4 | 10203003121311011101333 |
5 | 10110144043202120221 |
6 | 110312202013341011 |
7 | 4133011656315112 |
oct | 443033165052177 |
9 | 77732118083367 |
10 | 20001022301311 |
11 | 6411427733157 |
12 | 22b03b9a97767 |
13 | b2111c02b95c |
14 | 4d20a9d32579 |
15 | 24a4149c0041 |
hex | 1230d9d4547f |
20001022301311 has 8 divisors (see below), whose sum is σ = 20199682349600. Its totient is φ = 19802448317952.
The previous prime is 20001022301297. The next prime is 20001022301399. The reversal of 20001022301311 is 11310322010002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20001022301311 - 29 = 20001022300799 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001022305311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21049086 + ... + 21978763.
It is an arithmetic number, because the mean of its divisors is an integer number (2524960293700).
Almost surely, 220001022301311 is an apocalyptic number.
20001022301311 is a deficient number, since it is larger than the sum of its proper divisors (198660048289).
20001022301311 is a wasteful number, since it uses less digits than its factorization.
20001022301311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43032465.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 20001022301311 its reverse (11310322010002), we get a palindrome (31311344311313).
The spelling of 20001022301311 in words is "twenty trillion, one billion, twenty-two million, three hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •