Base | Representation |
---|---|
bin | 1001001011111101001100… |
… | …10010010001001101111101 |
3 | 2122112021221120121122001021 |
4 | 10211332212102101031331 |
5 | 10121442214334000221 |
6 | 110544402541144141 |
7 | 4153355625133225 |
oct | 445764622211575 |
9 | 78467846548037 |
10 | 20202021000061 |
11 | 64896a120951a |
12 | 2323353b5b051 |
13 | b37072220924 |
14 | 4dbad6903085 |
15 | 25077a96a041 |
hex | 125fa649137d |
20202021000061 has 2 divisors, whose sum is σ = 20202021000062. Its totient is φ = 20202021000060.
The previous prime is 20202021000037. The next prime is 20202021000103. The reversal of 20202021000061 is 16000012020202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19348649664100 + 853371335961 = 4398710^2 + 923781^2 .
It is a cyclic number.
It is not a de Polignac number, because 20202021000061 - 29 = 20202020999549 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20202020999999 and 20202021000044.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20202021007061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10101010500030 + 10101010500031.
It is an arithmetic number, because the mean of its divisors is an integer number (10101010500031).
Almost surely, 220202021000061 is an apocalyptic number.
It is an amenable number.
20202021000061 is a deficient number, since it is larger than the sum of its proper divisors (1).
20202021000061 is an equidigital number, since it uses as much as digits as its factorization.
20202021000061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 20202021000061 its reverse (16000012020202), we get a palindrome (36202033020263).
The spelling of 20202021000061 in words is "twenty trillion, two hundred two billion, twenty-one million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.041 sec. • engine limits •