Base | Representation |
---|---|
bin | 11000001110011… |
… | …00010101100011 |
3 | 112011101020122020 |
4 | 30013030111203 |
5 | 404010242011 |
6 | 32055312523 |
7 | 5015163123 |
oct | 1407142543 |
9 | 464336566 |
10 | 203212131 |
11 | a4787311 |
12 | 5807b743 |
13 | 33140385 |
14 | 1cdbac83 |
15 | 12c91006 |
hex | c1cc563 |
203212131 has 4 divisors (see below), whose sum is σ = 270949512. Its totient is φ = 135474752.
The previous prime is 203212117. The next prime is 203212133. The reversal of 203212131 is 131212302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 203212131 - 27 = 203212003 is a prime.
It is a super-2 number, since 2×2032121312 = 82590340371122322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 203212131.
It is not an unprimeable number, because it can be changed into a prime (203212133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33868686 + ... + 33868691.
It is an arithmetic number, because the mean of its divisors is an integer number (67737378).
Almost surely, 2203212131 is an apocalyptic number.
203212131 is a deficient number, since it is larger than the sum of its proper divisors (67737381).
203212131 is an equidigital number, since it uses as much as digits as its factorization.
203212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67737380.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 203212131 is about 14255.2492436997. The cubic root of 203212131 is about 587.9177108454.
Adding to 203212131 its reverse (131212302), we get a palindrome (334424433).
The spelling of 203212131 in words is "two hundred three million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •