Base | Representation |
---|---|
bin | 1110000100011… |
… | …1101110101101 |
3 | 11010001020001222 |
4 | 3201013232231 |
5 | 110101422221 |
6 | 5504513125 |
7 | 1314416441 |
oct | 341075655 |
9 | 133036058 |
10 | 59014061 |
11 | 30348157 |
12 | 1791b7a5 |
13 | c2c3282 |
14 | 7ba2821 |
15 | 52aa9ab |
hex | 3847bad |
59014061 has 2 divisors, whose sum is σ = 59014062. Its totient is φ = 59014060.
The previous prime is 59014013. The next prime is 59014063. The reversal of 59014061 is 16041095.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 45981961 + 13032100 = 6781^2 + 3610^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-59014061 is a prime.
Together with 59014063, 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 59014061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (59014063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29507030 + 29507031.
It is an arithmetic number, because the mean of its divisors is an integer number (29507031).
Almost surely, 259014061 is an apocalyptic number.
It is an amenable number.
59014061 is a deficient number, since it is larger than the sum of its proper divisors (1).
59014061 is an equidigital number, since it uses as much as digits as its factorization.
59014061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 59014061 is about 7682.0609864801. The cubic root of 59014061 is about 389.3305653583.
The spelling of 59014061 in words is "fifty-nine million, fourteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •