Base | Representation |
---|---|
bin | 101111111001100… |
… | …110110011110001 |
3 | 2002000011122112222 |
4 | 233321212303301 |
5 | 3121212132241 |
6 | 211424330425 |
7 | 25625513354 |
oct | 5771466361 |
9 | 2060148488 |
10 | 803630321 |
11 | 3826a039a |
12 | 1a5173a15 |
13 | ca654400 |
14 | 78a3229b |
15 | 4a842a4b |
hex | 2fe66cf1 |
803630321 has 6 divisors (see below), whose sum is σ = 870203430. Its totient is φ = 741812448.
The previous prime is 803630297. The next prime is 803630323. The reversal of 803630321 is 123036308.
It can be written as a sum of positive squares in 3 ways, for example, as 105349696 + 698280625 = 10264^2 + 26425^2 .
It is not a de Polignac number, because 803630321 - 218 = 803368177 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a nialpdrome in base 13.
It is not an unprimeable number, because it can be changed into a prime (803630323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2377436 + ... + 2377773.
It is an arithmetic number, because the mean of its divisors is an integer number (145033905).
Almost surely, 2803630321 is an apocalyptic number.
It is an amenable number.
803630321 is a deficient number, since it is larger than the sum of its proper divisors (66573109).
803630321 is a wasteful number, since it uses less digits than its factorization.
803630321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4755235 (or 4755222 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 803630321 is about 28348.3742214611. The cubic root of 803630321 is about 929.7198527984.
Adding to 803630321 its reverse (123036308), we get a palindrome (926666629).
The spelling of 803630321 in words is "eight hundred three million, six hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •