Base | Representation |
---|---|
bin | 1110000101100… |
… | …1001000110001 |
3 | 11010011211212201 |
4 | 3201121020301 |
5 | 110111212421 |
6 | 5510223201 |
7 | 1315134346 |
oct | 341311061 |
9 | 133154781 |
10 | 59085361 |
11 | 30396785 |
12 | 17954b01 |
13 | c31986a |
14 | 7bc07cd |
15 | 52c1b91 |
hex | 3859231 |
59085361 has 2 divisors, whose sum is σ = 59085362. Its totient is φ = 59085360.
The previous prime is 59085347. The next prime is 59085371. The reversal of 59085361 is 16358095.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57289761 + 1795600 = 7569^2 + 1340^2 .
It is a cyclic number.
It is not a de Polignac number, because 59085361 - 27 = 59085233 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 59085361.
It is not a weakly prime, because it can be changed into another prime (59085331) 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, 29542680 + 29542681.
It is an arithmetic number, because the mean of its divisors is an integer number (29542681).
Almost surely, 259085361 is an apocalyptic number.
It is an amenable number.
59085361 is a deficient number, since it is larger than the sum of its proper divisors (1).
59085361 is an equidigital number, since it uses as much as digits as its factorization.
59085361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 37.
The square root of 59085361 is about 7686.7002673449. The cubic root of 59085361 is about 389.4872969173.
The spelling of 59085361 in words is "fifty-nine million, eighty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •