Base | Representation |
---|---|
bin | 101101100000001001010100… |
… | …011001101010011001010110 |
3 | 222020120101121002102111111011 |
4 | 231200021110121222121112 |
5 | 202212241024241000342 |
6 | 1545342212510402434 |
7 | 60103162652126443 |
oct | 5540112431523126 |
9 | 866511532374434 |
10 | 200121122203222 |
11 | 58845989378350 |
12 | 1a540992b0041a |
13 | 8788457acc10c |
14 | 375bcb20089ca |
15 | 1820922814717 |
hex | b6025466a656 |
200121122203222 has 32 divisors (see below), whose sum is σ = 328003308015264. Its totient is φ = 90816302803200.
The previous prime is 200121122203217. The next prime is 200121122203259. The reversal of 200121122203222 is 222302221121002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 200121122203193 and 200121122203202.
It is a congruent number.
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, 99704668 + ... + 101692000.
It is an arithmetic number, because the mean of its divisors is an integer number (10250103375477).
Almost surely, 2200121122203222 is an apocalyptic number.
200121122203222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
200121122203222 is a deficient number, since it is larger than the sum of its proper divisors (127882185812042).
200121122203222 is a wasteful number, since it uses less digits than its factorization.
200121122203222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1994784.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 200121122203222 its reverse (222302221121002), we get a palindrome (422423343324224).
The spelling of 200121122203222 in words is "two hundred trillion, one hundred twenty-one billion, one hundred twenty-two million, two hundred three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •