Base | Representation |
---|---|
bin | 1011101001000110001… |
… | …0011100101000010101 |
3 | 201010021001112000120202 |
4 | 2322101202130220111 |
5 | 11234110104101401 |
6 | 231514453110245 |
7 | 20310303560024 |
oct | 2722142345025 |
9 | 633231460522 |
10 | 200010222101 |
11 | 77907613218 |
12 | 3291b028385 |
13 | 15b2648ab61 |
14 | 99755c28bb |
15 | 53092e306b |
hex | 2e9189ca15 |
200010222101 has 4 divisors (see below), whose sum is σ = 200013007104. Its totient is φ = 200007437100.
The previous prime is 200010222091. The next prime is 200010222103. The reversal of 200010222101 is 101222010002.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 200010222101 - 26 = 200010222037 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 (200010222103) 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 3 ways as a sum of consecutive naturals, for example, 1281845 + ... + 1429386.
It is an arithmetic number, because the mean of its divisors is an integer number (50003251776).
Almost surely, 2200010222101 is an apocalyptic number.
It is an amenable number.
200010222101 is a deficient number, since it is larger than the sum of its proper divisors (2785003).
200010222101 is an equidigital number, since it uses as much as digits as its factorization.
200010222101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2785002.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200010222101 its reverse (101222010002), we get a palindrome (301232232103).
The spelling of 200010222101 in words is "two hundred billion, ten million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •