Base | Representation |
---|---|
bin | 10111111011101… |
… | …00101101100111 |
3 | 111222202110120001 |
4 | 23331310231213 |
5 | 402343143241 |
6 | 31530522131 |
7 | 4655253445 |
oct | 1375645547 |
9 | 458673501 |
10 | 200756071 |
11 | a335a00a |
12 | 57296347 |
13 | 32790499 |
14 | 1c93bb95 |
15 | 12958431 |
hex | bf74b67 |
200756071 has 8 divisors (see below), whose sum is σ = 211914800. Its totient is φ = 190183464.
The previous prime is 200756051. The next prime is 200756081. The reversal of 200756071 is 170657002.
It is not a de Polignac number, because 200756071 - 29 = 200755559 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 (200756011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7776 + ... + 21493.
It is an arithmetic number, because the mean of its divisors is an integer number (26489350).
Almost surely, 2200756071 is an apocalyptic number.
200756071 is a deficient number, since it is larger than the sum of its proper divisors (11158729).
200756071 is an frugal number, since it uses more digits than its factorization.
200756071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29326 (or 29288 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 28.
The square root of 200756071 is about 14168.8415546226. The cubic root of 200756071 is about 585.5395426512.
The spelling of 200756071 in words is "two hundred million, seven hundred fifty-six thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •