Base | Representation |
---|---|
bin | 1110000101111… |
… | …1111011111101 |
3 | 11010020021002021 |
4 | 3201133323331 |
5 | 110113110323 |
6 | 5511000141 |
7 | 1315311505 |
oct | 341377375 |
9 | 133207067 |
10 | 59113213 |
11 | 304056a5 |
12 | 17969051 |
13 | c329443 |
14 | 7bcaa05 |
15 | 52ca05d |
hex | 385fefd |
59113213 has 2 divisors, whose sum is σ = 59113214. Its totient is φ = 59113212.
The previous prime is 59113211. The next prime is 59113231. The reversal of 59113213 is 31231195.
Together with next prime (59113231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33489369 + 25623844 = 5787^2 + 5062^2 .
It is a cyclic number.
It is not a de Polignac number, because 59113213 - 21 = 59113211 is a prime.
Together with 59113211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (59113211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29556606 + 29556607.
It is an arithmetic number, because the mean of its divisors is an integer number (29556607).
Almost surely, 259113213 is an apocalyptic number.
It is an amenable number.
59113213 is a deficient number, since it is larger than the sum of its proper divisors (1).
59113213 is an equidigital number, since it uses as much as digits as its factorization.
59113213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 810, while the sum is 25.
The square root of 59113213 is about 7688.5117545595. The cubic root of 59113213 is about 389.5484868969.
The spelling of 59113213 in words is "fifty-nine million, one hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •