Base | Representation |
---|---|
bin | 11000010101111… |
… | …00110011000001 |
3 | 112020020021200222 |
4 | 30022330303001 |
5 | 404233301212 |
6 | 32132352425 |
7 | 5026434461 |
oct | 1412746301 |
9 | 466207628 |
10 | 204197057 |
11 | a529a2a9 |
12 | 58475715 |
13 | 333c677c |
14 | 1d195ba1 |
15 | 12dd7c72 |
hex | c2bccc1 |
204197057 has 4 divisors (see below), whose sum is σ = 204598740. Its totient is φ = 203795376.
The previous prime is 204197029. The next prime is 204197069. The reversal of 204197057 is 750791402.
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 190881856 + 13315201 = 13816^2 + 3649^2 .
It is a cyclic number.
It is not a de Polignac number, because 204197057 - 210 = 204196033 is a prime.
It is a super-2 number, since 2×2041970572 = 83392876174922498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204197027) 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 3 ways as a sum of consecutive naturals, for example, 200078 + ... + 201095.
It is an arithmetic number, because the mean of its divisors is an integer number (51149685).
Almost surely, 2204197057 is an apocalyptic number.
It is an amenable number.
204197057 is a deficient number, since it is larger than the sum of its proper divisors (401683).
204197057 is an equidigital number, since it uses as much as digits as its factorization.
204197057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401682.
The product of its (nonzero) digits is 17640, while the sum is 35.
The square root of 204197057 is about 14289.7535668044. The cubic root of 204197057 is about 588.8660177990.
The spelling of 204197057 in words is "two hundred four million, one hundred ninety-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •