Base | Representation |
---|---|
bin | 1110001000101… |
… | …0110111000101 |
3 | 11010120012020222 |
4 | 3202022313011 |
5 | 110134222104 |
6 | 5514434125 |
7 | 1316643212 |
oct | 342126705 |
9 | 133505228 |
10 | 59289029 |
11 | 305157a8 |
12 | 17a32945 |
13 | c38b487 |
14 | 7c34b09 |
15 | 53121be |
hex | 388adc5 |
59289029 has 2 divisors, whose sum is σ = 59289030. Its totient is φ = 59289028.
The previous prime is 59289023. The next prime is 59289073. The reversal of 59289029 is 92098295.
59289029 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (59289073) can be obtained adding 59289029 to its sum of digits (44).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50438404 + 8850625 = 7102^2 + 2975^2 .
It is a cyclic number.
It is not a de Polignac number, because 59289029 - 224 = 42511813 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (59289023) 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, 29644514 + 29644515.
It is an arithmetic number, because the mean of its divisors is an integer number (29644515).
Almost surely, 259289029 is an apocalyptic number.
It is an amenable number.
59289029 is a deficient number, since it is larger than the sum of its proper divisors (1).
59289029 is an equidigital number, since it uses as much as digits as its factorization.
59289029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 44.
The square root of 59289029 is about 7699.9369477938. The cubic root of 59289029 is about 389.9343062699.
The spelling of 59289029 in words is "fifty-nine million, two hundred eighty-nine thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •