Base | Representation |
---|---|
bin | 10010110100000101… |
… | …001000001011101101 |
3 | 1221010211221211110111 |
4 | 102310011020023231 |
5 | 312332441043201 |
6 | 13140311540021 |
7 | 1313413423066 |
oct | 226405101355 |
9 | 57124854414 |
10 | 20201112301 |
11 | 8627001737 |
12 | 3ab938a611 |
13 | 1b9c2612b6 |
14 | d98cb756d |
15 | 7d3744b51 |
hex | 4b41482ed |
20201112301 has 4 divisors (see below), whose sum is σ = 20224685052. Its totient is φ = 20177539552.
The previous prime is 20201112293. The next prime is 20201112307. The reversal of 20201112301 is 10321110202.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19230478276 + 970634025 = 138674^2 + 31155^2 .
It is a cyclic number.
It is not a de Polignac number, because 20201112301 - 23 = 20201112293 is a prime.
It is a super-2 number, since 2×202011123012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20201112307) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11785090 + ... + 11786803.
It is an arithmetic number, because the mean of its divisors is an integer number (5056171263).
Almost surely, 220201112301 is an apocalyptic number.
It is an amenable number.
20201112301 is a deficient number, since it is larger than the sum of its proper divisors (23572751).
20201112301 is an equidigital number, since it uses as much as digits as its factorization.
20201112301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23572750.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 20201112301 its reverse (10321110202), we get a palindrome (30522222503).
The spelling of 20201112301 in words is "twenty billion, two hundred one million, one hundred twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •