Base | Representation |
---|---|
bin | 11000001111001… |
… | …01101110101101 |
3 | 112011120112022110 |
4 | 30013211232231 |
5 | 404022104031 |
6 | 32101434233 |
7 | 5016105300 |
oct | 1407455655 |
9 | 464515273 |
10 | 203316141 |
11 | a4848476 |
12 | 5810b979 |
13 | 33178812 |
14 | 1d006b37 |
15 | 12cb1c46 |
hex | c1e5bad |
203316141 has 24 divisors (see below), whose sum is σ = 333901440. Its totient is φ = 109345152.
The previous prime is 203316137. The next prime is 203316143. The reversal of 203316141 is 141613302.
It is not a de Polignac number, because 203316141 - 22 = 203316137 is a prime.
It is a super-2 number, since 2×2033161412 = 82674906382263762, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203316143) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38181 + ... + 43178.
It is an arithmetic number, because the mean of its divisors is an integer number (13912560).
Almost surely, 2203316141 is an apocalyptic number.
203316141 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
203316141 is a deficient number, since it is larger than the sum of its proper divisors (130585299).
203316141 is a wasteful number, since it uses less digits than its factorization.
203316141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81393 (or 81386 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 203316141 is about 14258.8969068438. The cubic root of 203316141 is about 588.0179983153.
Adding to 203316141 its reverse (141613302), we get a palindrome (344929443).
The spelling of 203316141 in words is "two hundred three million, three hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •