Base | Representation |
---|---|
bin | 11000001111110… |
… | …11001111000111 |
3 | 112011202000011001 |
4 | 30013323033013 |
5 | 404032413411 |
6 | 32103354131 |
7 | 5016623152 |
oct | 1407731707 |
9 | 464660131 |
10 | 203404231 |
11 | a48a8678 |
12 | 58152947 |
13 | 331a9944 |
14 | 1d02ac99 |
15 | 12cccdc1 |
hex | c1fb3c7 |
203404231 has 8 divisors (see below), whose sum is σ = 211639680. Its totient is φ = 195250272.
The previous prime is 203404219. The next prime is 203404259. The reversal of 203404231 is 132404302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 203404231 - 215 = 203371463 is a prime.
It is a super-2 number, since 2×2034042312 = 82746562377402722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 203404199 and 203404208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203404261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15255 + ... + 25288.
It is an arithmetic number, because the mean of its divisors is an integer number (26454960).
Almost surely, 2203404231 is an apocalyptic number.
203404231 is a deficient number, since it is larger than the sum of its proper divisors (8235449).
203404231 is a wasteful number, since it uses less digits than its factorization.
203404231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40745.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 203404231 is about 14261.9855209575. The cubic root of 203404231 is about 588.1029088167.
Adding to 203404231 its reverse (132404302), we get a palindrome (335808533).
The spelling of 203404231 in words is "two hundred three million, four hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •