Base | Representation |
---|---|
bin | 1011101001011110001… |
… | …0111101100010111101 |
3 | 201010112002012002121110 |
4 | 2322113202331202331 |
5 | 11234311410121341 |
6 | 231532453352233 |
7 | 20312636415060 |
oct | 2722742754275 |
9 | 633462162543 |
10 | 200111020221 |
11 | 779594aa352 |
12 | 32948938679 |
13 | 15b41320a08 |
14 | 9984b408d7 |
15 | 53130a4216 |
hex | 2e978bd8bd |
200111020221 has 16 divisors (see below), whose sum is σ = 320980083200. Its totient is φ = 108330777648.
The previous prime is 200111020199. The next prime is 200111020247. The reversal of 200111020221 is 122020111002.
It is not a de Polignac number, because 200111020221 - 25 = 200111020189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200111020197 and 200111020206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200111020121) 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, 250765291 + ... + 250766088.
It is an arithmetic number, because the mean of its divisors is an integer number (20061255200).
Almost surely, 2200111020221 is an apocalyptic number.
200111020221 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
200111020221 is a deficient number, since it is larger than the sum of its proper divisors (120869062979).
200111020221 is a wasteful number, since it uses less digits than its factorization.
200111020221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501531408.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200111020221 its reverse (122020111002), we get a palindrome (322131131223).
The spelling of 200111020221 in words is "two hundred billion, one hundred eleven million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •