Base | Representation |
---|---|
bin | 1011101001100000010… |
… | …1010011010011000011 |
3 | 201010112201010110000111 |
4 | 2322120011103103003 |
5 | 11234321211202321 |
6 | 231533414332151 |
7 | 20313106056664 |
oct | 2723005232303 |
9 | 633481113014 |
10 | 200120022211 |
11 | 7796359870a |
12 | 3294b95a057 |
13 | 15b43153235 |
14 | 998600536b |
15 | 5313c815e1 |
hex | 2e981534c3 |
200120022211 has 16 divisors (see below), whose sum is σ = 207677343744. Its totient is φ = 192724425504.
The previous prime is 200120022203. The next prime is 200120022239. The reversal of 200120022211 is 112220021002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 200120022211 - 23 = 200120022203 is a prime.
It is a super-2 number, since 2×2001200222112 (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 = 200120022191 and 200120022200.
It is not an unprimeable number, because it can be changed into a prime (200150022211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 628386 + ... + 891688.
It is an arithmetic number, because the mean of its divisors is an integer number (12979833984).
Almost surely, 2200120022211 is an apocalyptic number.
200120022211 is a deficient number, since it is larger than the sum of its proper divisors (7557321533).
200120022211 is a wasteful number, since it uses less digits than its factorization.
200120022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263610.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200120022211 its reverse (112220021002), we get a palindrome (312340043213).
The spelling of 200120022211 in words is "two hundred billion, one hundred twenty million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •