Base | Representation |
---|---|
bin | 101111011010100011000100… |
… | …010111101001010010000101 |
3 | 1000100100111221201120020102001 |
4 | 233122203010113221102011 |
5 | 204313044123423010013 |
6 | 2015302310205145301 |
7 | 61631656622433133 |
oct | 5732430427512205 |
9 | 1010314851506361 |
10 | 208532546688133 |
11 | 6049917a19a548 |
12 | 1b47b007b5b231 |
13 | 8c486c4b91145 |
14 | 396d059c56753 |
15 | 1919624110ddd |
hex | bda8c45e9485 |
208532546688133 has 8 divisors (see below), whose sum is σ = 208783265241600. Its totient is φ = 208281833302128.
The previous prime is 208532546687981. The next prime is 208532546688173. The reversal of 208532546688133 is 331886645235802.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-208532546688133 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 (208532546688173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 82750060 + ... + 85232842.
It is an arithmetic number, because the mean of its divisors is an integer number (26097908155200).
Almost surely, 2208532546688133 is an apocalyptic number.
It is an amenable number.
208532546688133 is a deficient number, since it is larger than the sum of its proper divisors (250718553467).
208532546688133 is a wasteful number, since it uses less digits than its factorization.
208532546688133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2583731.
The product of its (nonzero) digits is 199065600, while the sum is 64.
The spelling of 208532546688133 in words is "two hundred eight trillion, five hundred thirty-two billion, five hundred forty-six million, six hundred eighty-eight thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •