Base | Representation |
---|---|
bin | 10111111101001… |
… | …10011001110001 |
3 | 112000010210202012 |
4 | 23332212121301 |
5 | 402421201401 |
6 | 31535132305 |
7 | 4660062023 |
oct | 1376463161 |
9 | 460123665 |
10 | 200959601 |
11 | a3488a17 |
12 | 57374095 |
13 | 3283200b |
14 | 1c992013 |
15 | 129988bb |
hex | bfa6671 |
200959601 has 8 divisors (see below), whose sum is σ = 212936040. Its totient is φ = 189000448.
The previous prime is 200959547. The next prime is 200959609. The reversal of 200959601 is 106959002.
It can be written as a sum of positive squares in 4 ways, for example, as 37503376 + 163456225 = 6124^2 + 12785^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 200959601 - 214 = 200943217 is a prime.
It is a super-2 number, since 2×2009596012 = 80769522468158402, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200959609) 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, 25595 + ... + 32511.
It is an arithmetic number, because the mean of its divisors is an integer number (26617005).
Almost surely, 2200959601 is an apocalyptic number.
It is an amenable number.
200959601 is a deficient number, since it is larger than the sum of its proper divisors (11976439).
200959601 is a wasteful number, since it uses less digits than its factorization.
200959601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8643.
The product of its (nonzero) digits is 4860, while the sum is 32.
The square root of 200959601 is about 14176.0220442831. The cubic root of 200959601 is about 585.7373525461.
The spelling of 200959601 in words is "two hundred million, nine hundred fifty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •