Base | Representation |
---|---|
bin | 1011101001111000011… |
… | …0111011001100111101 |
3 | 201010210202100021220110 |
4 | 2322132012323030331 |
5 | 11240023101023401 |
6 | 231551425140233 |
7 | 20315444235534 |
oct | 2723606731475 |
9 | 633722307813 |
10 | 200221111101 |
11 | 77a05663250 |
12 | 3297978a679 |
13 | 15b5b08854b |
14 | 99955db31b |
15 | 531ca9d9d6 |
hex | 2e9e1bb33d |
200221111101 has 8 divisors (see below), whose sum is σ = 291230707104. Its totient is φ = 121346127920.
The previous prime is 200221111091. The next prime is 200221111133. The reversal of 200221111101 is 101111122002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200221111101 - 26 = 200221111037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200221111141) 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 7 ways as a sum of consecutive naturals, for example, 3033653166 + ... + 3033653231.
It is an arithmetic number, because the mean of its divisors is an integer number (36403838388).
Almost surely, 2200221111101 is an apocalyptic number.
It is an amenable number.
200221111101 is a deficient number, since it is larger than the sum of its proper divisors (91009596003).
200221111101 is a wasteful number, since it uses less digits than its factorization.
200221111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6067306411.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 200221111101 its reverse (101111122002), we get a palindrome (301332233103).
It can be divided in two parts, 20022 and 1111101, that multiplied together give a palindrome (22246464222).
The spelling of 200221111101 in words is "two hundred billion, two hundred twenty-one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •