Base | Representation |
---|---|
bin | 11010000110011… |
… | …10100110100001 |
3 | 120020222211000002 |
4 | 31003032212201 |
5 | 422022400144 |
6 | 33420505345 |
7 | 5266021223 |
oct | 1503164641 |
9 | 506884002 |
10 | 218950049 |
11 | 10265645a |
12 | 613ab255 |
13 | 36490856 |
14 | 21116413 |
15 | 1434e14e |
hex | d0ce9a1 |
218950049 has 8 divisors (see below), whose sum is σ = 225386280. Its totient is φ = 212599296.
The previous prime is 218950031. The next prime is 218950079. The reversal of 218950049 is 940059812.
It can be written as a sum of positive squares in 4 ways, for example, as 15745024 + 203205025 = 3968^2 + 14255^2 .
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 218950049 - 28 = 218949793 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 218949994 and 218950021.
It is not an unprimeable number, because it can be changed into a prime (218950009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16154 + ... + 26435.
It is an arithmetic number, because the mean of its divisors is an integer number (28173285).
Almost surely, 2218950049 is an apocalyptic number.
It is an amenable number.
218950049 is a deficient number, since it is larger than the sum of its proper divisors (6436231).
218950049 is an equidigital number, since it uses as much as digits as its factorization.
218950049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42739.
The product of its (nonzero) digits is 25920, while the sum is 38.
The square root of 218950049 is about 14796.9608028135. The cubic root of 218950049 is about 602.7191849575.
The spelling of 218950049 in words is "two hundred eighteen million, nine hundred fifty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •