Base | Representation |
---|---|
bin | 1100100110100100000 |
3 | 202222110211 |
4 | 1210310200 |
5 | 101203320 |
6 | 12503504 |
7 | 3336652 |
oct | 1446440 |
9 | 688424 |
10 | 412960 |
11 | 262299 |
12 | 17ab94 |
13 | 115c72 |
14 | aa6d2 |
15 | 8255a |
hex | 64d20 |
412960 has 48 divisors (see below), whose sum is σ = 1020600. Its totient is φ = 157696.
The previous prime is 412949. The next prime is 412967. The reversal of 412960 is 69214.
It can be written as a sum of positive squares in 4 ways, for example, as 274576 + 138384 = 524^2 + 372^2 .
It is not an unprimeable number, because it can be changed into a prime (412967) by changing a digit.
412960 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4596 + ... + 4684.
2412960 is an apocalyptic number.
412960 is a gapful number since it is divisible by the number (40) 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 412960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (510300).
412960 is an abundant number, since it is smaller than the sum of its proper divisors (607640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
412960 is a wasteful number, since it uses less digits than its factorization.
412960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133 (or 125 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 412960 is about 642.6196386666. The cubic root of 412960 is about 74.4679380978.
The spelling of 412960 in words is "four hundred twelve thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •