Base | Representation |
---|---|
bin | 11000001111001… |
… | …00100011010000 |
3 | 112011120021200121 |
4 | 30013210203100 |
5 | 404021430222 |
6 | 32101400024 |
7 | 5016055231 |
oct | 1407444320 |
9 | 464507617 |
10 | 203311312 |
11 | a4844886 |
12 | 58109014 |
13 | 33176569 |
14 | 1d005088 |
15 | 12cb05c7 |
hex | c1e48d0 |
203311312 has 10 divisors (see below), whose sum is σ = 393915698. Its totient is φ = 101655648.
The previous prime is 203311307. The next prime is 203311349. The reversal of 203311312 is 213113302.
It can be written as a sum of positive squares in only one way, i.e., 201526416 + 1784896 = 14196^2 + 1336^2 .
It is a super-3 number, since 3×2033113123 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 12706957 = 203311312 / (2 + 0 + 3 + 3 + 1 + 1 + 3 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6353463 + ... + 6353494.
Almost surely, 2203311312 is an apocalyptic number.
It is an amenable number.
203311312 is a deficient number, since it is larger than the sum of its proper divisors (190604386).
203311312 is a wasteful number, since it uses less digits than its factorization.
203311312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12706965 (or 12706959 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 203311312 is about 14258.7275729639. The cubic root of 203311312 is about 588.0133429030.
Adding to 203311312 its reverse (213113302), we get a palindrome (416424614).
The spelling of 203311312 in words is "two hundred three million, three hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •