Base | Representation |
---|---|
bin | 1000110110001111000 |
3 | 112201200111 |
4 | 1012301320 |
5 | 33234122 |
6 | 10114104 |
7 | 2315140 |
oct | 1066170 |
9 | 481614 |
10 | 289912 |
11 | 1888a7 |
12 | 11b934 |
13 | a1c5c |
14 | 77920 |
15 | 5ad77 |
hex | 46c78 |
289912 has 32 divisors (see below), whose sum is σ = 645120. Its totient is φ = 119520.
The previous prime is 289897. The next prime is 289937. The reversal of 289912 is 219982.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 289912.
It is an unprimeable number.
289912 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1653 + ... + 1819.
It is an arithmetic number, because the mean of its divisors is an integer number (20160).
2289912 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 289912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (322560).
289912 is an abundant number, since it is smaller than the sum of its proper divisors (355208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
289912 is a wasteful number, since it uses less digits than its factorization.
289912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211 (or 207 counting only the distinct ones).
The product of its digits is 2592, while the sum is 31.
The square root of 289912 is about 538.4347685653. The cubic root of 289912 is about 66.1843636153.
The spelling of 289912 in words is "two hundred eighty-nine thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •