Base | Representation |
---|---|
bin | 10111111100011… |
… | …00011101101001 |
3 | 111222221102000002 |
4 | 23332030131221 |
5 | 402404301403 |
6 | 31532552345 |
7 | 4656140201 |
oct | 1376143551 |
9 | 458842002 |
10 | 200853353 |
11 | a3416108 |
12 | 573226b5 |
13 | 327c584c |
14 | 1c965401 |
15 | 12977188 |
hex | bf8c769 |
200853353 has 4 divisors (see below), whose sum is σ = 206281860. Its totient is φ = 195424848.
The previous prime is 200853349. The next prime is 200853377. The reversal of 200853353 is 353358002.
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 102981904 + 97871449 = 10148^2 + 9893^2 .
It is a cyclic number.
It is not a de Polignac number, because 200853353 - 22 = 200853349 is a prime.
It is a super-2 number, since 2×2008533532 = 80684138822685218, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200858353) 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, 2714198 + ... + 2714271.
It is an arithmetic number, because the mean of its divisors is an integer number (51570465).
Almost surely, 2200853353 is an apocalyptic number.
It is an amenable number.
200853353 is a deficient number, since it is larger than the sum of its proper divisors (5428507).
200853353 is an equidigital number, since it uses as much as digits as its factorization.
200853353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5428506.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 200853353 is about 14172.2740941600. The cubic root of 200853353 is about 585.6341072623.
The spelling of 200853353 in words is "two hundred million, eight hundred fifty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •