Base | Representation |
---|---|
bin | 10111111010111… |
… | …01010000000000 |
3 | 111222120120201200 |
4 | 23331131100000 |
5 | 402332104333 |
6 | 31524501200 |
7 | 4654403325 |
oct | 1375352000 |
9 | 458516650 |
10 | 200659968 |
11 | a32a3893 |
12 | 5724a800 |
13 | 32758812 |
14 | 1c914b4c |
15 | 12939c13 |
hex | bf5d400 |
200659968 has 66 divisors (see below), whose sum is σ = 579427914. Its totient is φ = 66883584.
The previous prime is 200659957. The next prime is 200660011. The reversal of 200659968 is 869956002.
It can be written as a sum of positive squares in only one way, i.e., 137170944 + 63489024 = 11712^2 + 7968^2 .
It is a super-2 number, since 2×2006599682 = 80528845515522048, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 1671 + ... + 20102.
Almost surely, 2200659968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200659968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (289713957).
200659968 is an abundant number, since it is smaller than the sum of its proper divisors (378767946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200659968 is a wasteful number, since it uses less digits than its factorization.
200659968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21799 (or 21778 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The square root of 200659968 is about 14165.4497987180. The cubic root of 200659968 is about 585.4460941060.
The spelling of 200659968 in words is "two hundred million, six hundred fifty-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •