Base | Representation |
---|---|
bin | 11011001100001010100 |
3 | 1200021011200 |
4 | 3121201110 |
5 | 212002324 |
6 | 31032500 |
7 | 10400364 |
oct | 3314124 |
9 | 1607150 |
10 | 890964 |
11 | 559438 |
12 | 36b730 |
13 | 2526c9 |
14 | 1929a4 |
15 | 128ec9 |
hex | d9854 |
890964 has 18 divisors (see below), whose sum is σ = 2252250. Its totient is φ = 296976.
The previous prime is 890963. The next prime is 890969. The reversal of 890964 is 469098.
It can be written as a sum of positive squares in only one way, i.e., 887364 + 3600 = 942^2 + 60^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Smith number, since the sum of its digits (36) 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 (36), and also a Moran number because the ratio is a prime number: 24749 = 890964 / (8 + 9 + 0 + 9 + 6 + 4).
It is a nialpdrome in base 16.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (890963) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12339 + ... + 12410.
It is an arithmetic number, because the mean of its divisors is an integer number (125125).
2890964 is an apocalyptic number.
It is an amenable number.
890964 is an abundant number, since it is smaller than the sum of its proper divisors (1361286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
890964 is a wasteful number, since it uses less digits than its factorization.
890964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24759 (or 24754 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 890964 is about 943.9088939087. The cubic root of 890964 is about 96.2247339090.
The spelling of 890964 in words is "eight hundred ninety thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •