Base | Representation |
---|---|
bin | 11110110100101… |
… | …01010000000101 |
3 | 200000112021001102 |
4 | 33122111100011 |
5 | 1012142423104 |
6 | 41353505445 |
7 | 6256506146 |
oct | 1732252005 |
9 | 600467042 |
10 | 258561029 |
11 | 122a50801 |
12 | 72712285 |
13 | 4174c2bc |
14 | 264a7acd |
15 | 17a75a1e |
hex | f695405 |
258561029 has 2 divisors, whose sum is σ = 258561030. Its totient is φ = 258561028.
The previous prime is 258560999. The next prime is 258561067. The reversal of 258561029 is 920165852.
It is an a-pointer prime, because the next prime (258561067) can be obtained adding 258561029 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 247338529 + 11222500 = 15727^2 + 3350^2 .
It is a cyclic number.
It is not a de Polignac number, because 258561029 - 216 = 258495493 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 258560983 and 258561001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (258561529) 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 as a sum of consecutive naturals, namely, 129280514 + 129280515.
It is an arithmetic number, because the mean of its divisors is an integer number (129280515).
Almost surely, 2258561029 is an apocalyptic number.
It is an amenable number.
258561029 is a deficient number, since it is larger than the sum of its proper divisors (1).
258561029 is an equidigital number, since it uses as much as digits as its factorization.
258561029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 38.
The square root of 258561029 is about 16079.8329904262. The cubic root of 258561029 is about 637.0707844650.
The spelling of 258561029 in words is "two hundred fifty-eight million, five hundred sixty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •