Base | Representation |
---|---|
bin | 10111101100000… |
… | …01000100001001 |
3 | 111211220111012121 |
4 | 23312001010021 |
5 | 401332201023 |
6 | 31415011241 |
7 | 4632001012 |
oct | 1366010411 |
9 | 454814177 |
10 | 198709513 |
11 | a2191442 |
12 | 56669b21 |
13 | 32224ac2 |
14 | 1c568009 |
15 | 126a1d5d |
hex | bd81109 |
198709513 has 4 divisors (see below), whose sum is σ = 201967108. Its totient is φ = 195451920.
The previous prime is 198709501. The next prime is 198709571. The reversal of 198709513 is 315907891.
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 108326464 + 90383049 = 10408^2 + 9507^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-198709513 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 198709513.
It is not an unprimeable number, because it can be changed into a prime (198701513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1628706 + ... + 1628827.
It is an arithmetic number, because the mean of its divisors is an integer number (50491777).
Almost surely, 2198709513 is an apocalyptic number.
It is an amenable number.
198709513 is a deficient number, since it is larger than the sum of its proper divisors (3257595).
198709513 is an equidigital number, since it uses as much as digits as its factorization.
198709513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3257594.
The product of its (nonzero) digits is 68040, while the sum is 43.
The square root of 198709513 is about 14096.4361808224. The cubic root of 198709513 is about 583.5430303142.
The spelling of 198709513 in words is "one hundred ninety-eight million, seven hundred nine thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •