Base | Representation |
---|---|
bin | 101101100001100101011010… |
… | …101100110000101110111101 |
3 | 222020220211211220020211020021 |
4 | 231201211122230300232331 |
5 | 202220401041100333041 |
6 | 1545455445340452141 |
7 | 60113263356430624 |
oct | 5541453254605675 |
9 | 866824756224207 |
10 | 200220012121021 |
11 | 58883915132242 |
12 | 1a557b90b4a051 |
13 | 879488763aa89 |
14 | 37629b38646bb |
15 | 18232ae375cd1 |
hex | b6195ab30bbd |
200220012121021 has 16 divisors (see below), whose sum is σ = 206148846657600. Its totient is φ = 194341000712320.
The previous prime is 200220012121009. The next prime is 200220012121109. The reversal of 200220012121021 is 120121210022002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 200220012121021 - 213 = 200220012112829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200220012120986 and 200220012121004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200220012121321) 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, 433496010 + ... + 433957636.
It is an arithmetic number, because the mean of its divisors is an integer number (12884302916100).
Almost surely, 2200220012121021 is an apocalyptic number.
It is an amenable number.
200220012121021 is a deficient number, since it is larger than the sum of its proper divisors (5928834536579).
200220012121021 is a wasteful number, since it uses less digits than its factorization.
200220012121021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 515564.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 200220012121021 its reverse (120121210022002), we get a palindrome (320341222143023).
The spelling of 200220012121021 in words is "two hundred trillion, two hundred twenty billion, twelve million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •