Base | Representation |
---|---|
bin | 1001001011111011010100… |
… | …01001101000001101111011 |
3 | 2122112012100021012022002211 |
4 | 10211331222021220031323 |
5 | 10121433133044231021 |
6 | 110544114501035551 |
7 | 4153321624502416 |
oct | 445755211501573 |
9 | 78465307168084 |
10 | 20201012102011 |
11 | 6489223768484 |
12 | 23231120b5bb7 |
13 | b36c411b9630 |
14 | 4dba3c91ab7d |
15 | 25071c0cc3e1 |
hex | 125f6a26837b |
20201012102011 has 8 divisors (see below), whose sum is σ = 21769546564640. Its totient is φ = 18634564847232.
The previous prime is 20201012102009. The next prime is 20201012102017. The reversal of 20201012102011 is 11020121010202.
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 20201012102011 - 21 = 20201012102009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20201012101982 and 20201012102000.
It is not an unprimeable number, because it can be changed into a prime (20201012102017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 521781855 + ... + 521820568.
It is an arithmetic number, because the mean of its divisors is an integer number (2721193320580).
Almost surely, 220201012102011 is an apocalyptic number.
20201012102011 is a deficient number, since it is larger than the sum of its proper divisors (1568534462629).
20201012102011 is a wasteful number, since it uses less digits than its factorization.
20201012102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1043603925.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20201012102011 its reverse (11020121010202), we get a palindrome (31221133112213).
The spelling of 20201012102011 in words is "twenty trillion, two hundred one billion, twelve million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •