Base | Representation |
---|---|
bin | 1110001000110… |
… | …1110100101001 |
3 | 11010120210220022 |
4 | 3202031310221 |
5 | 110140114121 |
6 | 5515010225 |
7 | 1320023453 |
oct | 342156451 |
9 | 133523808 |
10 | 59301161 |
11 | 30523927 |
12 | 17a39975 |
13 | c393b5a |
14 | 7c392d3 |
15 | 5315aab |
hex | 388dd29 |
59301161 has 2 divisors, whose sum is σ = 59301162. Its totient is φ = 59301160.
The previous prime is 59301139. The next prime is 59301163. The reversal of 59301161 is 16110395.
59301161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 54760000 + 4541161 = 7400^2 + 2131^2 .
It is a cyclic number.
It is not a de Polignac number, because 59301161 - 218 = 59039017 is a prime.
Together with 59301163, 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 59301161.
It is not a weakly prime, because it can be changed into another prime (59301163) 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, 29650580 + 29650581.
It is an arithmetic number, because the mean of its divisors is an integer number (29650581).
Almost surely, 259301161 is an apocalyptic number.
It is an amenable number.
59301161 is a deficient number, since it is larger than the sum of its proper divisors (1).
59301161 is an equidigital number, since it uses as much as digits as its factorization.
59301161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 26.
The square root of 59301161 is about 7700.7247061559. The cubic root of 59301161 is about 389.9609011866.
The spelling of 59301161 in words is "fifty-nine million, three hundred one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •