Base | Representation |
---|---|
bin | 1011101001111000011… |
… | …0100000010110001111 |
3 | 201010210202010201000110 |
4 | 2322132012200112033 |
5 | 11240023034013403 |
6 | 231551422531103 |
7 | 20315443300044 |
oct | 2723606402617 |
9 | 633722121013 |
10 | 200221001103 |
11 | 77a05598642 |
12 | 32979736a93 |
13 | 15b5b04a466 |
14 | 99955ad1cb |
15 | 531ca7b103 |
hex | 2e9e1a058f |
200221001103 has 4 divisors (see below), whose sum is σ = 266961334808. Its totient is φ = 133480667400.
The previous prime is 200221001089. The next prime is 200221001131. The reversal of 200221001103 is 301100122002.
200221001103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 200221001103 - 212 = 200220997007 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200221001153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33370166848 + ... + 33370166853.
It is an arithmetic number, because the mean of its divisors is an integer number (66740333702).
Almost surely, 2200221001103 is an apocalyptic number.
200221001103 is a deficient number, since it is larger than the sum of its proper divisors (66740333705).
200221001103 is an equidigital number, since it uses as much as digits as its factorization.
200221001103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66740333704.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 200221001103 its reverse (301100122002), we get a palindrome (501321123105).
The spelling of 200221001103 in words is "two hundred billion, two hundred twenty-one million, one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •