Base | Representation |
---|---|
bin | 11000001110011… |
… | …10100000110101 |
3 | 112011101200212101 |
4 | 30013032200311 |
5 | 404011033140 |
6 | 32055422101 |
7 | 5015231116 |
oct | 1407164065 |
9 | 464350771 |
10 | 203221045 |
11 | a4792a85 |
12 | 58084931 |
13 | 33144451 |
14 | 1cdc020d |
15 | 12c9399a |
hex | c1ce835 |
203221045 has 8 divisors (see below), whose sum is σ = 244401624. Its totient is φ = 162219264.
The previous prime is 203221037. The next prime is 203221049. The reversal of 203221045 is 540122302.
It can be written as a sum of positive squares in 4 ways, for example, as 66471409 + 136749636 = 8153^2 + 11694^2 .
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 203221045 - 23 = 203221037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203221049) 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, 42184 + ... + 46753.
It is an arithmetic number, because the mean of its divisors is an integer number (30550203).
Almost surely, 2203221045 is an apocalyptic number.
It is an amenable number.
203221045 is a deficient number, since it is larger than the sum of its proper divisors (41180579).
203221045 is an equidigital number, since it uses as much as digits as its factorization.
203221045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89399.
The product of its (nonzero) digits is 480, while the sum is 19.
The square root of 203221045 is about 14255.5618970281. The cubic root of 203221045 is about 587.9263071528.
Adding to 203221045 its reverse (540122302), we get a palindrome (743343347).
The spelling of 203221045 in words is "two hundred three million, two hundred twenty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •