Base | Representation |
---|---|
bin | 101101100110011001101100… |
… | …011000110010000010101111 |
3 | 222022002111020111112011100112 |
4 | 231212121230120302002233 |
5 | 202241311442431331213 |
6 | 1550311511201250235 |
7 | 60146222160462632 |
oct | 5546315430620257 |
9 | 868074214464315 |
10 | 200551021355183 |
11 | 589a1235223094 |
12 | 1a5b016b33397b |
13 | 87b9b59952a45 |
14 | 3774a15083c19 |
15 | 182bbd4065ea8 |
hex | b6666c6320af |
200551021355183 has 2 divisors, whose sum is σ = 200551021355184. Its totient is φ = 200551021355182.
The previous prime is 200551021355177. The next prime is 200551021355297. The reversal of 200551021355183 is 381553120155002.
It is a happy number.
200551021355183 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200551021355183 - 214 = 200551021338799 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200551021355183.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200551021355173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100275510677591 + 100275510677592.
It is an arithmetic number, because the mean of its divisors is an integer number (100275510677592).
Almost surely, 2200551021355183 is an apocalyptic number.
200551021355183 is a deficient number, since it is larger than the sum of its proper divisors (1).
200551021355183 is an equidigital number, since it uses as much as digits as its factorization.
200551021355183 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 180000, while the sum is 41.
The spelling of 200551021355183 in words is "two hundred trillion, five hundred fifty-one billion, twenty-one million, three hundred fifty-five thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •