Base | Representation |
---|---|
bin | 10010110100000001… |
… | …010011100000010101 |
3 | 1221010210001220200222 |
4 | 102310001103200111 |
5 | 312332212010401 |
6 | 13140234244125 |
7 | 1313402050163 |
oct | 226401234025 |
9 | 57123056628 |
10 | 20200110101 |
11 | 8626487776 |
12 | 3ab8b86645 |
13 | 1b9bca0092 |
14 | d98ad6233 |
15 | 7d35e7c1b |
hex | 4b4053815 |
20200110101 has 8 divisors (see below), whose sum is σ = 20479813464. Its totient is φ = 19920487680.
The previous prime is 20200110089. The next prime is 20200110121. The reversal of 20200110101 is 10101100202.
It can be written as a sum of positive squares in 4 ways, for example, as 1231659025 + 18968451076 = 35095^2 + 137726^2 .
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 20200110101 - 214 = 20200093717 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 (20200110121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 622265 + ... + 653921.
It is an arithmetic number, because the mean of its divisors is an integer number (2559976683).
Almost surely, 220200110101 is an apocalyptic number.
It is an amenable number.
20200110101 is a deficient number, since it is larger than the sum of its proper divisors (279703363).
20200110101 is an equidigital number, since it uses as much as digits as its factorization.
20200110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40471.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 20200110101 its reverse (10101100202), we get a palindrome (30301210303).
The spelling of 20200110101 in words is "twenty billion, two hundred million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •