Base | Representation |
---|---|
bin | 101101100001011101000111… |
… | …011111101101111100010110 |
3 | 222020212222211210112011112202 |
4 | 231201131013133231330112 |
5 | 202220224313100000042 |
6 | 1545451413135044502 |
7 | 60112526461566566 |
oct | 5541350737557426 |
9 | 866788753464482 |
10 | 200211100000022 |
11 | 58880061503891 |
12 | 1a556304370732 |
13 | 8793a971491b7 |
14 | 37623a9da6da6 |
15 | 1822e3bc57632 |
hex | b617477edf16 |
200211100000022 has 8 divisors (see below), whose sum is σ = 300318791242872. Its totient is φ = 100104836252400.
The previous prime is 200211099999997. The next prime is 200211100000027. The reversal of 200211100000022 is 220000001112002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 200211099999949 and 200211100000012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211100000027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 356523104 + ... + 357084227.
It is an arithmetic number, because the mean of its divisors is an integer number (37539848905359).
Almost surely, 2200211100000022 is an apocalyptic number.
200211100000022 is a deficient number, since it is larger than the sum of its proper divisors (100107691242850).
200211100000022 is a wasteful number, since it uses less digits than its factorization.
200211100000022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 713747614.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200211100000022 its reverse (220000001112002), we get a palindrome (420211101112024).
The spelling of 200211100000022 in words is "two hundred trillion, two hundred eleven billion, one hundred million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •