Base | Representation |
---|---|
bin | 1100000101010111100 |
3 | 202010011100 |
4 | 1200222330 |
5 | 100132324 |
6 | 12253100 |
7 | 3236262 |
oct | 1405274 |
9 | 663140 |
10 | 395964 |
11 | 250548 |
12 | 171190 |
13 | 10b2ca |
14 | a4432 |
15 | 7c4c9 |
hex | 60abc |
395964 has 36 divisors (see below), whose sum is σ = 1061424. Its totient is φ = 124032.
The previous prime is 395959. The next prime is 395971. The reversal of 395964 is 469593.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nialpdrome in base 14.
It is a congruent number.
It is an unprimeable number.
395964 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 11 ways as a sum of consecutive naturals, for example, 289 + ... + 935.
It is an arithmetic number, because the mean of its divisors is an integer number (29484).
2395964 is an apocalyptic number.
395964 is a gapful number since it is divisible by the number (34) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 395964, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (530712).
395964 is an abundant number, since it is smaller than the sum of its proper divisors (665460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
395964 is a wasteful number, since it uses less digits than its factorization.
395964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674 (or 669 counting only the distinct ones).
The product of its digits is 29160, while the sum is 36.
The square root of 395964 is about 629.2567043743. The cubic root of 395964 is about 73.4319792741.
The spelling of 395964 in words is "three hundred ninety-five thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •