Base | Representation |
---|---|
bin | 1011101001110110000… |
… | …0011001101001111101 |
3 | 201010210001100012211212 |
4 | 2322131200121221331 |
5 | 11240013004342341 |
6 | 231550424454205 |
7 | 20315262344663 |
oct | 2723540315175 |
9 | 633701305755 |
10 | 200211012221 |
11 | 779aa995870 |
12 | 3297631a365 |
13 | 15b58c6098c |
14 | 999412cc33 |
15 | 531bc565eb |
hex | 2e9d819a7d |
200211012221 has 8 divisors (see below), whose sum is σ = 221671894944. Its totient is φ = 179293443120.
The previous prime is 200211012161. The next prime is 200211012223. The reversal of 200211012221 is 122210112002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-200211012221 is a prime.
It is a super-2 number, since 2×2002110122212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211012196 and 200211012205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211012223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135827630 + ... + 135829103.
It is an arithmetic number, because the mean of its divisors is an integer number (27708986868).
Almost surely, 2200211012221 is an apocalyptic number.
It is an amenable number.
200211012221 is a deficient number, since it is larger than the sum of its proper divisors (21460882723).
200211012221 is a wasteful number, since it uses less digits than its factorization.
200211012221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271656811.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200211012221 its reverse (122210112002), we get a palindrome (322421124223).
The spelling of 200211012221 in words is "two hundred billion, two hundred eleven million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •