Base | Representation |
---|---|
bin | 1011101011011101100… |
… | …0001000000011101101 |
3 | 201011220022001122120120 |
4 | 2322313120020003231 |
5 | 11241410113104410 |
6 | 232101451435153 |
7 | 20332112535006 |
oct | 2726730100355 |
9 | 634808048516 |
10 | 200645050605 |
11 | 7810299a27a |
12 | 32a77755ab9 |
13 | 15bc7b5c41c |
14 | 99d5a341ad |
15 | 5344de0570 |
hex | 2eb76080ed |
200645050605 has 16 divisors (see below), whose sum is σ = 321040325760. Its totient is φ = 107007945408.
The previous prime is 200645050603. The next prime is 200645050633. The reversal of 200645050605 is 506050546002.
It is a happy number.
200645050605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 200645050605 - 21 = 200645050603 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200645050603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 522216 + ... + 820974.
It is an arithmetic number, because the mean of its divisors is an integer number (20065020360).
Almost surely, 2200645050605 is an apocalyptic number.
It is an amenable number.
200645050605 is a deficient number, since it is larger than the sum of its proper divisors (120395275155).
200645050605 is a wasteful number, since it uses less digits than its factorization.
200645050605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343540.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 200645050605 its reverse (506050546002), we get a palindrome (706695596607).
The spelling of 200645050605 in words is "two hundred billion, six hundred forty-five million, fifty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •