Base | Representation |
---|---|
bin | 1001001011111101001011… |
… | …01001011100111100101001 |
3 | 2122112021220211111000121011 |
4 | 10211332211221130330221 |
5 | 10121442204114101301 |
6 | 110544401515543521 |
7 | 4153355435160262 |
oct | 445764551347451 |
9 | 78467824430534 |
10 | 20202010300201 |
11 | 6489696170564 |
12 | 232335045aba1 |
13 | b3706cc45652 |
14 | 4dbad5319969 |
15 | 250779a54a51 |
hex | 125fa5a5cf29 |
20202010300201 has 4 divisors (see below), whose sum is σ = 20202089434372. Its totient is φ = 20201931166032.
The previous prime is 20202010300187. The next prime is 20202010300223. The reversal of 20202010300201 is 10200301020202.
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 19442358603801 + 759651696400 = 4409349^2 + 871580^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20202010300201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20202010300231) 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, 39182910 + ... + 39695143.
It is an arithmetic number, because the mean of its divisors is an integer number (5050522358593).
Almost surely, 220202010300201 is an apocalyptic number.
It is an amenable number.
20202010300201 is a deficient number, since it is larger than the sum of its proper divisors (79134171).
20202010300201 is an equidigital number, since it uses as much as digits as its factorization.
20202010300201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79134170.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 20202010300201 its reverse (10200301020202), we get a palindrome (30402311320403).
The spelling of 20202010300201 in words is "twenty trillion, two hundred two billion, ten million, three hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •