Base | Representation |
---|---|
bin | 101101100000001001011010… |
… | …010110011001100010001100 |
3 | 222020120101212001020021001021 |
4 | 231200021122112121202030 |
5 | 202212241230313323040 |
6 | 1545342230433523524 |
7 | 60103165303361332 |
oct | 5540113226314214 |
9 | 866511761207037 |
10 | 200121222011020 |
11 | 58845a2a748432 |
12 | 1a540a004135a4 |
13 | 87884726a629b |
14 | 375bcc1389b52 |
15 | 182092b47c24a |
hex | b6025a59988c |
200121222011020 has 48 divisors (see below), whose sum is σ = 429208581191040. Its totient is φ = 78343060783104.
The previous prime is 200121222011017. The next prime is 200121222011077. The reversal of 200121222011020 is 20110222121002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 200121222010985 and 200121222011003.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29580172 + ... + 35710348.
It is an arithmetic number, because the mean of its divisors is an integer number (8941845441480).
Almost surely, 2200121222011020 is an apocalyptic number.
200121222011020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200121222011020 is an abundant number, since it is smaller than the sum of its proper divisors (229087359180020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200121222011020 is a wasteful number, since it uses less digits than its factorization.
200121222011020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6164962 (or 6164960 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 200121222011020 its reverse (20110222121002), we get a palindrome (220231444132022).
The spelling of 200121222011020 in words is "two hundred trillion, one hundred twenty-one billion, two hundred twenty-two million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •