Base | Representation |
---|---|
bin | 1001001011111011011111… |
… | …00000101001000110011101 |
3 | 2122112012120112101122210112 |
4 | 10211331233200221012131 |
5 | 10121433324104133041 |
6 | 110544131432215405 |
7 | 4153324066010105 |
oct | 445755740510635 |
9 | 78465515348715 |
10 | 20201102021021 |
11 | 648926a4a3a09 |
12 | 232313823a565 |
13 | b36c56a1074c |
14 | 4dba4a846205 |
15 | 250724e3edeb |
hex | 125f6f82919d |
20201102021021 has 8 divisors (see below), whose sum is σ = 20852803025664. Its totient is φ = 19549404300960.
The previous prime is 20201102020991. The next prime is 20201102021069. The reversal of 20201102021021 is 12012020110202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20201102021021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20201102020987 and 20201102021005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20201102021081) 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, 20308346 + ... + 21279828.
It is an arithmetic number, because the mean of its divisors is an integer number (2606600378208).
Almost surely, 220201102021021 is an apocalyptic number.
It is an amenable number.
20201102021021 is a deficient number, since it is larger than the sum of its proper divisors (651701004643).
20201102021021 is an equidigital number, since it uses as much as digits as its factorization.
20201102021021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1642291.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20201102021021 its reverse (12012020110202), we get a palindrome (32213122131223).
The spelling of 20201102021021 in words is "twenty trillion, two hundred one billion, one hundred two million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •