Base | Representation |
---|---|
bin | 101101100001100101100110… |
… | …100111001111110011100101 |
3 | 222020220212100211100211102021 |
4 | 231201211212213033303211 |
5 | 202220401443233031041 |
6 | 1545455521240543141 |
7 | 60113301334411231 |
oct | 5541454647176345 |
9 | 866825324324367 |
10 | 200220212002021 |
11 | 58883a07a43852 |
12 | 1a558027a81ab1 |
13 | 87948b9b82b63 |
14 | 37629d22155c1 |
15 | 18232c1ba9cd1 |
hex | b619669cfce5 |
200220212002021 has 16 divisors (see below), whose sum is σ = 211965538973760. Its totient is φ = 188798662926720.
The previous prime is 200220212002001. The next prime is 200220212002037. The reversal of 200220212002021 is 120200212022002.
It is a cyclic number.
It is not a de Polignac number, because 200220212002021 - 229 = 200219675131109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200220212001986 and 200220212002004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200220212002001) 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, 1651206 + ... + 20079016.
It is an arithmetic number, because the mean of its divisors is an integer number (13247846185860).
Almost surely, 2200220212002021 is an apocalyptic number.
It is an amenable number.
200220212002021 is a deficient number, since it is larger than the sum of its proper divisors (11745326971739).
200220212002021 is a wasteful number, since it uses less digits than its factorization.
200220212002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18436596.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 200220212002021 its reverse (120200212022002), we get a palindrome (320420424024023).
The spelling of 200220212002021 in words is "two hundred trillion, two hundred twenty billion, two hundred twelve million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •