Base | Representation |
---|---|
bin | 10111110111011… |
… | …00000010100000 |
3 | 111221201000122011 |
4 | 23323230002200 |
5 | 402222240011 |
6 | 31510522304 |
7 | 4650432361 |
oct | 1373540240 |
9 | 457630564 |
10 | 200196256 |
11 | a3007457 |
12 | 57066394 |
13 | 32625730 |
14 | 1c833b68 |
15 | 12897621 |
hex | beec0a0 |
200196256 has 48 divisors (see below), whose sum is σ = 426270600. Its totient is φ = 92003328.
The previous prime is 200196239. The next prime is 200196277. The reversal of 200196256 is 652691002.
It can be written as a sum of positive squares in 4 ways, for example, as 140659600 + 59536656 = 11860^2 + 7716^2 .
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 7 ways as a sum of consecutive naturals, for example, 111010 + ... + 112798.
Almost surely, 2200196256 is an apocalyptic number.
200196256 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200196256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (213135300).
200196256 is an abundant number, since it is smaller than the sum of its proper divisors (226074344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200196256 is a wasteful number, since it uses less digits than its factorization.
200196256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2081 (or 2073 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 31.
The square root of 200196256 is about 14149.0726197868. The cubic root of 200196256 is about 584.9947704502.
The spelling of 200196256 in words is "two hundred million, one hundred ninety-six thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •