Base | Representation |
---|---|
bin | 1011101011001111011… |
… | …0101111010101101000 |
3 | 201011202011212220001010 |
4 | 2322303312233111220 |
5 | 11241300001420302 |
6 | 232051541223520 |
7 | 20330464405320 |
oct | 2726366572550 |
9 | 634664786033 |
10 | 200585966952 |
11 | 78082604908 |
12 | 32a5ba01ba0 |
13 | 15bb8843597 |
14 | 99cbc54280 |
15 | 533eb1e16c |
hex | 2eb3daf568 |
200585966952 has 32 divisors (see below), whose sum is σ = 573102763200. Its totient is φ = 57310276224.
The previous prime is 200585966881. The next prime is 200585966963. The reversal of 200585966952 is 259669585002.
It is a junction number, because it is equal to n+sod(n) for n = 200585966892 and 200585966901.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 596981877 + ... + 596982212.
It is an arithmetic number, because the mean of its divisors is an integer number (17909461350).
Almost surely, 2200585966952 is an apocalyptic number.
It is an amenable number.
200585966952 is an abundant number, since it is smaller than the sum of its proper divisors (372516796248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200585966952 is a wasteful number, since it uses less digits than its factorization.
200585966952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1193964105 (or 1193964101 counting only the distinct ones).
The product of its (nonzero) digits is 11664000, while the sum is 57.
The spelling of 200585966952 in words is "two hundred billion, five hundred eighty-five million, nine hundred sixty-six thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •