Base | Representation |
---|---|
bin | 11000010011011… |
… | …00100100001111 |
3 | 112012121120220122 |
4 | 30021230210033 |
5 | 404142242211 |
6 | 32121335155 |
7 | 5023565414 |
oct | 1411544417 |
9 | 465546818 |
10 | 203868431 |
11 | a5095408 |
12 | 583374bb |
13 | 33310010 |
14 | 1d10c10b |
15 | 12d706db |
hex | c26c90f |
203868431 has 8 divisors (see below), whose sum is σ = 226633344. Its totient is φ = 182115360.
The previous prime is 203868421. The next prime is 203868439. The reversal of 203868431 is 134868302.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 203868431 - 26 = 203868367 is a prime.
It is a super-2 number, since 2×2038684312 = 83124674316803522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203868391 and 203868400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203868439) 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 7 ways as a sum of consecutive naturals, for example, 252536 + ... + 253341.
It is an arithmetic number, because the mean of its divisors is an integer number (28329168).
Almost surely, 2203868431 is an apocalyptic number.
203868431 is a deficient number, since it is larger than the sum of its proper divisors (22764913).
203868431 is a wasteful number, since it uses less digits than its factorization.
203868431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505921.
The product of its (nonzero) digits is 27648, while the sum is 35.
The square root of 203868431 is about 14278.2502779577. The cubic root of 203868431 is about 588.5499495980.
The spelling of 203868431 in words is "two hundred three million, eight hundred sixty-eight thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •