Base | Representation |
---|---|
bin | 11000010000000… |
… | …10010010111101 |
3 | 112011210110211002 |
4 | 30020002102331 |
5 | 404034330044 |
6 | 32104140045 |
7 | 5020103363 |
oct | 1410022275 |
9 | 464713732 |
10 | 203433149 |
11 | a4918377 |
12 | 58167625 |
13 | 331b9b5a |
14 | 1d037633 |
15 | 12cd674e |
hex | c2024bd |
203433149 has 2 divisors, whose sum is σ = 203433150. Its totient is φ = 203433148.
The previous prime is 203433143. The next prime is 203433151. The reversal of 203433149 is 941334302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129163225 + 74269924 = 11365^2 + 8618^2 .
It is a cyclic number.
It is not a de Polignac number, because 203433149 - 216 = 203367613 is a prime.
It is a super-2 number, since 2×2034331492 = 82770092224112402, which contains 22 as substring.
Together with 203433151, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203433143) by changing a digit.
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, 101716574 + 101716575.
It is an arithmetic number, because the mean of its divisors is an integer number (101716575).
Almost surely, 2203433149 is an apocalyptic number.
It is an amenable number.
203433149 is a deficient number, since it is larger than the sum of its proper divisors (1).
203433149 is an equidigital number, since it uses as much as digits as its factorization.
203433149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
The square root of 203433149 is about 14262.9992988852. Note that the first 3 decimals coincide. The cubic root of 203433149 is about 588.1307777126.
The spelling of 203433149 in words is "two hundred three million, four hundred thirty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •