Base | Representation |
---|---|
bin | 10001010100010… |
… | …001011101110001 |
3 | 202020200022020120 |
4 | 101110101131301 |
5 | 1043333331324 |
6 | 44455000453 |
7 | 10125303516 |
oct | 2124213561 |
9 | 666608216 |
10 | 290527089 |
11 | 139aa4336 |
12 | 81369129 |
13 | 48262128 |
14 | 2a82930d |
15 | 1a78c179 |
hex | 11511771 |
290527089 has 8 divisors (see below), whose sum is σ = 388409472. Its totient is φ = 193164720.
The previous prime is 290527073. The next prime is 290527121. The reversal of 290527089 is 980725092.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 290527089 - 24 = 290527073 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 290527089.
It is not an unprimeable number, because it can be changed into a prime (290527019) 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 7 ways as a sum of consecutive naturals, for example, 128697 + ... + 130934.
It is an arithmetic number, because the mean of its divisors is an integer number (48551184).
Almost surely, 2290527089 is an apocalyptic number.
It is an amenable number.
290527089 is a deficient number, since it is larger than the sum of its proper divisors (97882383).
290527089 is a wasteful number, since it uses less digits than its factorization.
290527089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260007.
The product of its (nonzero) digits is 90720, while the sum is 42.
The square root of 290527089 is about 17044.8552061905. The cubic root of 290527089 is about 662.3113702445.
The spelling of 290527089 in words is "two hundred ninety million, five hundred twenty-seven thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •