Base | Representation |
---|---|
bin | 10001000000110… |
… | …100111100000101 |
3 | 201220002022200022 |
4 | 101000310330011 |
5 | 1041032221014 |
6 | 44153424525 |
7 | 10034053001 |
oct | 2100647405 |
9 | 656068608 |
10 | 285429509 |
11 | 137132462 |
12 | 7b70b145 |
13 | 47198b01 |
14 | 29c9d701 |
15 | 1a0d1a8e |
hex | 11034f05 |
285429509 has 2 divisors, whose sum is σ = 285429510. Its totient is φ = 285429508.
The previous prime is 285429461. The next prime is 285429511. The reversal of 285429509 is 905924582.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 279892900 + 5536609 = 16730^2 + 2353^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-285429509 is a prime.
Together with 285429511, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 285429509.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (285429569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 142714754 + 142714755.
It is an arithmetic number, because the mean of its divisors is an integer number (142714755).
Almost surely, 2285429509 is an apocalyptic number.
It is an amenable number.
285429509 is a deficient number, since it is larger than the sum of its proper divisors (1).
285429509 is an equidigital number, since it uses as much as digits as its factorization.
285429509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 44.
The square root of 285429509 is about 16894.6591856717. The cubic root of 285429509 is about 658.4148591163.
The spelling of 285429509 in words is "two hundred eighty-five million, four hundred twenty-nine thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •