Base | Representation |
---|---|
bin | 10111111010011… |
… | …00011011001101 |
3 | 111222110002012021 |
4 | 23331030123031 |
5 | 402322403203 |
6 | 31523210141 |
7 | 4653665365 |
oct | 1375143315 |
9 | 458402167 |
10 | 200591053 |
11 | a3257033 |
12 | 57216951 |
13 | 32733340 |
14 | 1c8d79a5 |
15 | 129245bd |
hex | bf4c6cd |
200591053 has 8 divisors (see below), whose sum is σ = 218249528. Its totient is φ = 183250944.
The previous prime is 200591051. The next prime is 200591059. The reversal of 200591053 is 350195002.
It can be written as a sum of positive squares in 4 ways, for example, as 29452329 + 171138724 = 5427^2 + 13082^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 200591053 - 21 = 200591051 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200591051) 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 7 ways as a sum of consecutive naturals, for example, 78276 + ... + 80797.
It is an arithmetic number, because the mean of its divisors is an integer number (27281191).
Almost surely, 2200591053 is an apocalyptic number.
It is an amenable number.
200591053 is a deficient number, since it is larger than the sum of its proper divisors (17658475).
200591053 is a wasteful number, since it uses less digits than its factorization.
200591053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159183.
The product of its (nonzero) digits is 1350, while the sum is 25.
The square root of 200591053 is about 14163.0170867651. The cubic root of 200591053 is about 585.3790642317.
It can be divided in two parts, 20059 and 1053, that added together give a palindrome (21112).
The spelling of 200591053 in words is "two hundred million, five hundred ninety-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •