Base | Representation |
---|---|
bin | 11110000111010… |
… | …110001010110001 |
3 | 1022012200222010101 |
4 | 132013112022301 |
5 | 2013320223124 |
6 | 122045032401 |
7 | 15343326406 |
oct | 3607261261 |
9 | 1265628111 |
10 | 505242289 |
11 | 23a218012 |
12 | 121255701 |
13 | 8089c246 |
14 | 4b15c2ad |
15 | 2e551644 |
hex | 1e1d62b1 |
505242289 has 4 divisors (see below), whose sum is σ = 518897524. Its totient is φ = 491587056.
The previous prime is 505242253. The next prime is 505242293. The reversal of 505242289 is 982242505.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 420455025 + 84787264 = 20505^2 + 9208^2 .
It is a cyclic number.
It is not a de Polignac number, because 505242289 - 27 = 505242161 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37), and also a Moran number because the ratio is a prime number: 13655197 = 505242289 / (5 + 0 + 5 + 2 + 4 + 2 + 2 + 8 + 9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (505242589) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6827562 + ... + 6827635.
It is an arithmetic number, because the mean of its divisors is an integer number (129724381).
Almost surely, 2505242289 is an apocalyptic number.
It is an amenable number.
505242289 is a deficient number, since it is larger than the sum of its proper divisors (13655235).
505242289 is a wasteful number, since it uses less digits than its factorization.
505242289 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13655234.
The product of its (nonzero) digits is 57600, while the sum is 37.
The square root of 505242289 is about 22477.5952672878. The cubic root of 505242289 is about 796.4647594591.
The spelling of 505242289 in words is "five hundred five million, two hundred forty-two thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.198 sec. • engine limits •