Base | Representation |
---|---|
bin | 101101100001011100010001… |
… | …111010101110011000000110 |
3 | 222020212220112011002211021112 |
4 | 231201130101322232120012 |
5 | 202220220442441010042 |
6 | 1545451144024445022 |
7 | 60112465265263205 |
oct | 5541342172563006 |
9 | 866786464084245 |
10 | 200210201110022 |
11 | 5887a74006a494 |
12 | 1a5560b3319772 |
13 | 8793982b50b1c |
14 | 376232285923c |
15 | 1822dd7d99982 |
hex | b61711eae606 |
200210201110022 has 32 divisors (see below), whose sum is σ = 305179875172224. Its totient is φ = 98487369288000.
The previous prime is 200210201110021. The next prime is 200210201110037. The reversal of 200210201110022 is 220011102012002.
It is a junction number, because it is equal to n+sod(n) for n = 200210201109979 and 200210201110006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210201110021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 588335522 + ... + 588675722.
It is an arithmetic number, because the mean of its divisors is an integer number (9536871099132).
Almost surely, 2200210201110022 is an apocalyptic number.
200210201110022 is a deficient number, since it is larger than the sum of its proper divisors (104969674062202).
200210201110022 is a wasteful number, since it uses less digits than its factorization.
200210201110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345764.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200210201110022 its reverse (220011102012002), we get a palindrome (420221303122024).
The spelling of 200210201110022 in words is "two hundred trillion, two hundred ten billion, two hundred one million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •