Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …00001111001100001110101 |
3 | 2122112002210010210110210211 |
4 | 10211330233001321201311 |
5 | 10121424120134020041 |
6 | 110543432225345421 |
7 | 4153255221602245 |
oct | 445745701714165 |
9 | 78462703713724 |
10 | 20200020220021 |
11 | 64888648898a4 |
12 | 2322a95a98271 |
13 | b36b13862505 |
14 | 4db986cc3b25 |
15 | 2506aeea1481 |
hex | 125f2f079875 |
20200020220021 has 16 divisors (see below), whose sum is σ = 20929567166464. Its totient is φ = 19480436164224.
The previous prime is 20200020219997. The next prime is 20200020220063. The reversal of 20200020220021 is 12002202000202.
It is a cyclic number.
It is not a de Polignac number, because 20200020220021 - 25 = 20200020219989 is a prime.
It is a super-3 number, since 3×202000202200213 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20200020219983 and 20200020220010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20200020220321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2773336 + ... + 6934798.
It is an arithmetic number, because the mean of its divisors is an integer number (1308097947904).
Almost surely, 220200020220021 is an apocalyptic number.
It is an amenable number.
20200020220021 is a deficient number, since it is larger than the sum of its proper divisors (729546946443).
20200020220021 is a wasteful number, since it uses less digits than its factorization.
20200020220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4162660.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 20200020220021 its reverse (12002202000202), we get a palindrome (32202222220223).
The spelling of 20200020220021 in words is "twenty trillion, two hundred billion, twenty million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •