Base | Representation |
---|---|
bin | 1001001011111011100000… |
… | …00111111100001111000001 |
3 | 2122112012121020210001110122 |
4 | 10211331300013330033001 |
5 | 10121433334223314014 |
6 | 110544132441110025 |
7 | 4153324252405052 |
oct | 445756007741701 |
9 | 78465536701418 |
10 | 20201112323009 |
11 | 648927529aa52 |
12 | 232313b788315 |
13 | b36c58ba98b7 |
14 | 4dba4bd68729 |
15 | 250725cc758e |
hex | 125f701fc3c1 |
20201112323009 has 4 divisors (see below), whose sum is σ = 20346444066480. Its totient is φ = 20055780579540.
The previous prime is 20201112322961. The next prime is 20201112323027. The reversal of 20201112323009 is 90032321110202.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20201112323009 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20201112313009) 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 3 ways as a sum of consecutive naturals, for example, 72665871527 + ... + 72665871804.
It is an arithmetic number, because the mean of its divisors is an integer number (5086611016620).
Almost surely, 220201112323009 is an apocalyptic number.
It is an amenable number.
20201112323009 is a deficient number, since it is larger than the sum of its proper divisors (145331743471).
20201112323009 is a wasteful number, since it uses less digits than its factorization.
20201112323009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145331743470.
The product of its (nonzero) digits is 1296, while the sum is 26.
The spelling of 20201112323009 in words is "twenty trillion, two hundred one billion, one hundred twelve million, three hundred twenty-three thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •