Base | Representation |
---|---|
bin | 10111110110010… |
… | …01100100111101 |
3 | 111221102212000012 |
4 | 23323021210331 |
5 | 402203230401 |
6 | 31503513005 |
7 | 4646304011 |
oct | 1373114475 |
9 | 457385005 |
10 | 200055101 |
11 | a2a203a4 |
12 | 56bb8765 |
13 | 325a63cc |
14 | 1c7d8541 |
15 | 1286a8bb |
hex | bec993d |
200055101 has 4 divisors (see below), whose sum is σ = 200284092. Its totient is φ = 199826112.
The previous prime is 200055091. The next prime is 200055103. The reversal of 200055101 is 101550002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 175562500 + 24492601 = 13250^2 + 4949^2 .
It is a cyclic number.
It is not a de Polignac number, because 200055101 - 210 = 200054077 is a prime.
It is a super-2 number, since 2×2000551012 = 80044086872240402, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200055103) 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, 113180 + ... + 114933.
It is an arithmetic number, because the mean of its divisors is an integer number (50071023).
Almost surely, 2200055101 is an apocalyptic number.
It is an amenable number.
200055101 is a deficient number, since it is larger than the sum of its proper divisors (228991).
200055101 is an equidigital number, since it uses as much as digits as its factorization.
200055101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228990.
The product of its (nonzero) digits is 50, while the sum is 14.
The square root of 200055101 is about 14144.0836041081. The cubic root of 200055101 is about 584.8572481451.
The spelling of 200055101 in words is "two hundred million, fifty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •