Base | Representation |
---|---|
bin | 1110000101101… |
… | …0001101001101 |
3 | 11010012001212221 |
4 | 3201122031031 |
5 | 110111332431 |
6 | 5510255341 |
7 | 1315153204 |
oct | 341321515 |
9 | 133161787 |
10 | 59089741 |
11 | 30399aa7 |
12 | 17957551 |
13 | c31b859 |
14 | 7bc223b |
15 | 52c3111 |
hex | 385a34d |
59089741 has 4 divisors (see below), whose sum is σ = 59110684. Its totient is φ = 59068800.
The previous prime is 59089721. The next prime is 59089757. The reversal of 59089741 is 14798095.
59089741 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 29702500 + 29387241 = 5450^2 + 5421^2 .
It is a cyclic number.
It is not a de Polignac number, because 59089741 - 215 = 59056973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (59089711) 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 in 3 ways as a sum of consecutive naturals, for example, 5430 + ... + 12151.
It is an arithmetic number, because the mean of its divisors is an integer number (14777671).
Almost surely, 259089741 is an apocalyptic number.
It is an amenable number.
59089741 is a deficient number, since it is larger than the sum of its proper divisors (20943).
59089741 is a wasteful number, since it uses less digits than its factorization.
59089741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20942.
The product of its (nonzero) digits is 90720, while the sum is 43.
The square root of 59089741 is about 7686.9851697528. The cubic root of 59089741 is about 389.4969209154.
The spelling of 59089741 in words is "fifty-nine million, eighty-nine thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •