Base | Representation |
---|---|
bin | 1011101011001000001… |
… | …0001101100111010000 |
3 | 201011200001101221122200 |
4 | 2322302002031213100 |
5 | 11241214141420422 |
6 | 232044530403200 |
7 | 20326643641425 |
oct | 2726202154720 |
9 | 634601357580 |
10 | 200555420112 |
11 | 78067340593 |
12 | 32a51730500 |
13 | 15bb2409728 |
14 | 99c7b81d4c |
15 | 533c0d82ac |
hex | 2eb208d9d0 |
200555420112 has 60 divisors (see below), whose sum is σ = 565373592420. Its totient is φ = 66363830784.
The previous prime is 200555420081. The next prime is 200555420123. The reversal of 200555420112 is 211024555002.
200555420112 is a `hidden beast` number, since 2 + 0 + 0 + 5 + 5 + 542 + 0 + 112 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 70063972416 + 130491447696 = 264696^2 + 361236^2 .
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 5063287 + ... + 5102742.
It is an arithmetic number, because the mean of its divisors is an integer number (9422893207).
Almost surely, 2200555420112 is an apocalyptic number.
It is an amenable number.
200555420112 is an abundant number, since it is smaller than the sum of its proper divisors (364818172308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200555420112 is a wasteful number, since it uses less digits than its factorization.
200555420112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10166180 (or 10166171 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
Adding to 200555420112 its reverse (211024555002), we get a palindrome (411579975114).
The spelling of 200555420112 in words is "two hundred billion, five hundred fifty-five million, four hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •