Base | Representation |
---|---|
bin | 1011110101001000101… |
… | …1110110111100010101 |
3 | 201102121022020202102002 |
4 | 2331102023312330111 |
5 | 11312220012201003 |
6 | 233211311525045 |
7 | 20453351034113 |
oct | 2752213667425 |
9 | 642538222362 |
10 | 203242303253 |
11 | 79215a88670 |
12 | 33481529785 |
13 | 1621cc7ca02 |
14 | 9ba095cab3 |
15 | 5447e2ba88 |
hex | 2f522f6f15 |
203242303253 has 4 divisors (see below), whose sum is σ = 221718876288. Its totient is φ = 184765730220.
The previous prime is 203242303247. The next prime is 203242303307. The reversal of 203242303253 is 352303242302.
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 203242303253 - 28 = 203242302997 is a prime.
It is a super-3 number, since 3×2032423032533 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203242303753) 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, 9238286501 + ... + 9238286522.
It is an arithmetic number, because the mean of its divisors is an integer number (55429719072).
Almost surely, 2203242303253 is an apocalyptic number.
It is an amenable number.
203242303253 is a deficient number, since it is larger than the sum of its proper divisors (18476573035).
203242303253 is a wasteful number, since it uses less digits than its factorization.
203242303253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18476573034.
The product of its (nonzero) digits is 25920, while the sum is 29.
Adding to 203242303253 its reverse (352303242302), we get a palindrome (555545545555).
The spelling of 203242303253 in words is "two hundred three billion, two hundred forty-two million, three hundred three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •