Base | Representation |
---|---|
bin | 1011110101001010110… |
… | …1111101101000100001 |
3 | 201102121221001222012022 |
4 | 2331102231331220201 |
5 | 11312224304243203 |
6 | 233212231311225 |
7 | 20453520031121 |
oct | 2752255755041 |
9 | 642557058168 |
10 | 203251243553 |
11 | 79220034646 |
12 | 3348451b515 |
13 | 16221a90127 |
14 | 9ba1c08c81 |
15 | 5448ae5a38 |
hex | 2f52b7da21 |
203251243553 has 4 divisors (see below), whose sum is σ = 203475336240. Its totient is φ = 203027150868.
The previous prime is 203251243477. The next prime is 203251243577. The reversal of 203251243553 is 355342152302.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 203251243553 - 210 = 203251242529 is a prime.
It is a super-2 number, since 2×2032512435532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203251243753) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 112044983 + ... + 112046796.
It is an arithmetic number, because the mean of its divisors is an integer number (50868834060).
Almost surely, 2203251243553 is an apocalyptic number.
It is an amenable number.
203251243553 is a deficient number, since it is larger than the sum of its proper divisors (224092687).
203251243553 is an equidigital number, since it uses as much as digits as its factorization.
203251243553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224092686.
The product of its (nonzero) digits is 108000, while the sum is 35.
Adding to 203251243553 its reverse (355342152302), we get a palindrome (558593395855).
The spelling of 203251243553 in words is "two hundred three billion, two hundred fifty-one million, two hundred forty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •