Base | Representation |
---|---|
bin | 1011101011000111100… |
… | …1011000000010110101 |
3 | 201011122220001020220202 |
4 | 2322301321120002311 |
5 | 11241213043303131 |
6 | 232044405010245 |
7 | 20326615152530 |
oct | 2726171300265 |
9 | 634586036822 |
10 | 200553103541 |
11 | 78065aa906a |
12 | 32a509b3985 |
13 | 15bb1aa818b |
14 | 99c773ba17 |
15 | 533bccbbcb |
hex | 2eb1e580b5 |
200553103541 has 16 divisors (see below), whose sum is σ = 229538153856. Its totient is φ = 171651902976.
The previous prime is 200553103507. The next prime is 200553103549. The reversal of 200553103541 is 145301355002.
200553103541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200553103541 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200553103549) 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, 14764745 + ... + 14778321.
It is an arithmetic number, because the mean of its divisors is an integer number (14346134616).
Almost surely, 2200553103541 is an apocalyptic number.
It is an amenable number.
200553103541 is a deficient number, since it is larger than the sum of its proper divisors (28985050315).
200553103541 is a wasteful number, since it uses less digits than its factorization.
200553103541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16508.
The product of its (nonzero) digits is 9000, while the sum is 29.
Adding to 200553103541 its reverse (145301355002), we get a palindrome (345854458543).
The spelling of 200553103541 in words is "two hundred billion, five hundred fifty-three million, one hundred three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •