Base | Representation |
---|---|
bin | 10111110110010… |
… | …00011000100111 |
3 | 111221102121022020 |
4 | 23323020120213 |
5 | 402203101330 |
6 | 31503434223 |
7 | 4646253531 |
oct | 1373103047 |
9 | 457377266 |
10 | 200050215 |
11 | a2a17762 |
12 | 56bb5973 |
13 | 325a4111 |
14 | 1c7d6851 |
15 | 12869210 |
hex | bec8627 |
200050215 has 8 divisors (see below), whose sum is σ = 320080368. Its totient is φ = 106693440.
The previous prime is 200050163. The next prime is 200050229. The reversal of 200050215 is 512050002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200050215 - 27 = 200050087 is a prime.
It is a super-3 number, since 3×2000502153 (a number of 26 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 13336681 = 200050215 / (2 + 0 + 0 + 0 + 5 + 0 + 2 + 1 + 5).
It is a junction number, because it is equal to n+sod(n) for n = 200050194 and 200050203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6668326 + ... + 6668355.
It is an arithmetic number, because the mean of its divisors is an integer number (40010046).
Almost surely, 2200050215 is an apocalyptic number.
200050215 is a deficient number, since it is larger than the sum of its proper divisors (120030153).
200050215 is a wasteful number, since it uses less digits than its factorization.
200050215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13336689.
The product of its (nonzero) digits is 100, while the sum is 15.
The square root of 200050215 is about 14143.9108806581. The cubic root of 200050215 is about 584.8524867306.
The spelling of 200050215 in words is "two hundred million, fifty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •