Base | Representation |
---|---|
bin | 101101100001011100010011… |
… | …000110100110010110101111 |
3 | 222020212220120112112100100111 |
4 | 231201130103012212112233 |
5 | 202220221013034000421 |
6 | 1545451150015040451 |
7 | 60112465626323620 |
oct | 5541342306462657 |
9 | 866786515470314 |
10 | 200210221000111 |
11 | 5887a750315183 |
12 | 1a5560b9b10127 |
13 | 8793986cc61ca |
14 | 3762325355a47 |
15 | 1822dd99c7ee1 |
hex | b617131a65af |
200210221000111 has 16 divisors (see below), whose sum is σ = 232285888823040. Its totient is φ = 169004408950080.
The previous prime is 200210221000093. The next prime is 200210221000117. The reversal of 200210221000111 is 111000122012002.
It is a cyclic number.
It is not a de Polignac number, because 200210221000111 - 217 = 200210220869039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200210221000091 and 200210221000100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210221000117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52482505 + ... + 56167906.
It is an arithmetic number, because the mean of its divisors is an integer number (14517868051440).
Almost surely, 2200210221000111 is an apocalyptic number.
200210221000111 is a deficient number, since it is larger than the sum of its proper divisors (32075667822929).
200210221000111 is a wasteful number, since it uses less digits than its factorization.
200210221000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108654414.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200210221000111 its reverse (111000122012002), we get a palindrome (311210343012113).
The spelling of 200210221000111 in words is "two hundred trillion, two hundred ten billion, two hundred twenty-one million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •