Base | Representation |
---|---|
bin | 1010101011001… |
… | …10100011110001 |
3 | 20020111120012011 |
4 | 11111212203301 |
5 | 140411032131 |
6 | 12515202521 |
7 | 2135103631 |
oct | 525464361 |
9 | 206446164 |
10 | 89549041 |
11 | 4660357a |
12 | 25ba6441 |
13 | 157248ca |
14 | bc706c1 |
15 | 7cdd0b1 |
hex | 55668f1 |
89549041 has 4 divisors (see below), whose sum is σ = 90555300. Its totient is φ = 88542784.
The previous prime is 89549039. The next prime is 89549063. The reversal of 89549041 is 14094598.
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 29811600 + 59737441 = 5460^2 + 7729^2 .
It is a cyclic number.
It is not a de Polignac number, because 89549041 - 21 = 89549039 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 89548985 and 89549003.
It is not an unprimeable number, because it can be changed into a prime (89549011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 502996 + ... + 503173.
It is an arithmetic number, because the mean of its divisors is an integer number (22638825).
Almost surely, 289549041 is an apocalyptic number.
It is an amenable number.
89549041 is a deficient number, since it is larger than the sum of its proper divisors (1006259).
89549041 is a wasteful number, since it uses less digits than its factorization.
89549041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1006258.
The product of its (nonzero) digits is 51840, while the sum is 40.
The square root of 89549041 is about 9463.0355066437. The cubic root of 89549041 is about 447.3907284983.
The spelling of 89549041 in words is "eighty-nine million, five hundred forty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •