Base | Representation |
---|---|
bin | 1011110101001001011… |
… | …0010011101101101111 |
3 | 201102121111101221000021 |
4 | 2331102112103231233 |
5 | 11312221212330133 |
6 | 233211450343011 |
7 | 20453413233304 |
oct | 2752226235557 |
9 | 642544357007 |
10 | 203245042543 |
11 | 79217589744 |
12 | 3348242aa67 |
13 | 162206cb7aa |
14 | 9ba10730ab |
15 | 54482bd52d |
hex | 2f52593b6f |
203245042543 has 8 divisors (see below), whose sum is σ = 206200943136. Its totient is φ = 200291733600.
The previous prime is 203245042513. The next prime is 203245042577. The reversal of 203245042543 is 345240542302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 203245042543 - 29 = 203245042031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203245042499 and 203245042508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203245042513) 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, 489648 + ... + 803893.
It is an arithmetic number, because the mean of its divisors is an integer number (25775117892).
Almost surely, 2203245042543 is an apocalyptic number.
203245042543 is a deficient number, since it is larger than the sum of its proper divisors (2955900593).
203245042543 is a wasteful number, since it uses less digits than its factorization.
203245042543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1295825.
The product of its (nonzero) digits is 115200, while the sum is 34.
Adding to 203245042543 its reverse (345240542302), we get a palindrome (548485584845).
The spelling of 203245042543 in words is "two hundred three billion, two hundred forty-five million, forty-two thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •