Base | Representation |
---|---|
bin | 11110000110011… |
… | …011000110000001 |
3 | 1022012020200012121 |
4 | 132012123012001 |
5 | 2013240002241 |
6 | 122035524241 |
7 | 15341301100 |
oct | 3606330601 |
9 | 1265220177 |
10 | 505000321 |
11 | 23a072241 |
12 | 121159681 |
13 | 80816077 |
14 | 4b0d8037 |
15 | 2e504ad1 |
hex | 1e19b181 |
505000321 has 24 divisors (see below), whose sum is σ = 605672424. Its totient is φ = 419569920.
The previous prime is 505000313. The next prime is 505000339. The reversal of 505000321 is 123000505.
It can be written as a sum of positive squares in 4 ways, for example, as 192099600 + 312900721 = 13860^2 + 17689^2 .
It is not a de Polignac number, because 505000321 - 23 = 505000313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 505000295 and 505000304.
It is not an unprimeable number, because it can be changed into a prime (505000381) 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 23 ways as a sum of consecutive naturals, for example, 346831 + ... + 348283.
It is an arithmetic number, because the mean of its divisors is an integer number (25236351).
Almost surely, 2505000321 is an apocalyptic number.
It is an amenable number.
505000321 is a deficient number, since it is larger than the sum of its proper divisors (100672103).
505000321 is a wasteful number, since it uses less digits than its factorization.
505000321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1681 (or 1674 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 16.
The square root of 505000321 is about 22472.2121963994. The cubic root of 505000321 is about 796.3375929078.
Adding to 505000321 its reverse (123000505), we get a palindrome (628000826).
The spelling of 505000321 in words is "five hundred five million, three hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •