Base | Representation |
---|---|
bin | 10001001110111… |
… | …111101001011101 |
3 | 202011002000011102 |
4 | 101032333221131 |
5 | 1043010042024 |
6 | 44405202445 |
7 | 10110451433 |
oct | 2116775135 |
9 | 664060142 |
10 | 289143389 |
11 | 139239787 |
12 | 80a00425 |
13 | 47b99382 |
14 | 2a588d53 |
15 | 1a5b71ae |
hex | 113bfa5d |
289143389 has 4 divisors (see below), whose sum is σ = 295295424. Its totient is φ = 282991356.
The previous prime is 289143367. The next prime is 289143431. The reversal of 289143389 is 983341982.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 289143389 - 28 = 289143133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47), and also a Moran number because the ratio is a prime number: 6151987 = 289143389 / (2 + 8 + 9 + 1 + 4 + 3 + 3 + 8 + 9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (289140389) 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, 3075947 + ... + 3076040.
It is an arithmetic number, because the mean of its divisors is an integer number (73823856).
Almost surely, 2289143389 is an apocalyptic number.
It is an amenable number.
289143389 is a deficient number, since it is larger than the sum of its proper divisors (6152035).
289143389 is an equidigital number, since it uses as much as digits as its factorization.
289143389 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6152034.
The product of its digits is 373248, while the sum is 47.
The square root of 289143389 is about 17004.2168005469. The cubic root of 289143389 is about 661.2582280343.
The spelling of 289143389 in words is "two hundred eighty-nine million, one hundred forty-three thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •