Base | Representation |
---|---|
bin | 1100001000111001001… |
… | …0000111111001001011 |
3 | 201221021220020101112211 |
4 | 3002032102013321023 |
5 | 11404100124431203 |
6 | 235445434445551 |
7 | 21031644614500 |
oct | 3021622077113 |
9 | 657256211484 |
10 | 208545545803 |
11 | 80497584251 |
12 | 345015938b7 |
13 | 168868a325a |
14 | a144dd94a7 |
15 | 56587d2c6d |
hex | 308e487e4b |
208545545803 has 6 divisors (see below), whose sum is σ = 242593798236. Its totient is φ = 178753324932.
The previous prime is 208545545729. The next prime is 208545545837. The reversal of 208545545803 is 308545545802.
It is not a de Polignac number, because 208545545803 - 237 = 71106592331 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49), and also a Moran number because the ratio is a prime number: 4256031547 = 208545545803 / (2 + 0 + 8 + 5 + 4 + 5 + 5 + 4 + 5 + 8 + 0 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (208545545003) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2128015725 + ... + 2128015822.
It is an arithmetic number, because the mean of its divisors is an integer number (40432299706).
Almost surely, 2208545545803 is an apocalyptic number.
208545545803 is a deficient number, since it is larger than the sum of its proper divisors (34048252433).
208545545803 is an equidigital number, since it uses as much as digits as its factorization.
208545545803 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4256031561 (or 4256031554 counting only the distinct ones).
The product of its (nonzero) digits is 3840000, while the sum is 49.
Subtracting 208545545803 from its reverse (308545545802), we obtain a palindrome (99999999999).
The spelling of 208545545803 in words is "two hundred eight billion, five hundred forty-five million, five hundred forty-five thousand, eight hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •