Base | Representation |
---|---|
bin | 10111111100011… |
… | …01010101010011 |
3 | 111222221120220000 |
4 | 23332031111103 |
5 | 402404410130 |
6 | 31533021043 |
7 | 4656153450 |
oct | 1376152523 |
9 | 458846800 |
10 | 200856915 |
11 | a3418856 |
12 | 57324783 |
13 | 327c735c |
14 | 1c966827 |
15 | 12978260 |
hex | bf8d553 |
200856915 has 40 divisors (see below), whose sum is σ = 411496800. Its totient is φ = 91819008.
The previous prime is 200856889. The next prime is 200856919. The reversal of 200856915 is 519658002.
It is a happy number.
It is not a de Polignac number, because 200856915 - 27 = 200856787 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200856915.
It is not an unprimeable number, because it can be changed into a prime (200856919) 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 39 ways as a sum of consecutive naturals, for example, 32590 + ... + 38259.
It is an arithmetic number, because the mean of its divisors is an integer number (10287420).
Almost surely, 2200856915 is an apocalyptic number.
200856915 is an abundant number, since it is smaller than the sum of its proper divisors (210639885).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200856915 is an equidigital number, since it uses as much as digits as its factorization.
200856915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70873 (or 70864 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The square root of 200856915 is about 14172.3997615083. The cubic root of 200856915 is about 585.6375691850.
It can be divided in two parts, 20085 and 6915, that added together give a cube (27000 = 303).
The spelling of 200856915 in words is "two hundred million, eight hundred fifty-six thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •