Search results
Results from the WOW.Com Content Network
d() is the number of positive divisors of n, including 1 and n itself; σ() is the sum of the positive divisors of n, including 1 and n itselfs() is the sum of the proper divisors of n, including 1 but not n itself; that is, s(n) = σ(n) − n
It is divisible by 4 and by 5. 480: it is divisible by 4 and by 5. 21: Subtracting twice the last digit from the rest gives a multiple of 21. (Works because (10a + b) × 2 − 21a = −a + 2b; the last number has the same remainder as 10a + b.) 168: 16 − 8 × 2 = 0. Suming 19 times the last digit to the rest gives a multiple of 21.
2006 – number of subsets of {1,2,3,4,5,6,7,8,9,10,11} with relatively prime elements [6] 2007 – 2 2007 + 2007 2 is prime [7] 2008 – number of 4 × 4 matrices with nonnegative integer entries and row and column sums equal to 3 [8] 2009 = 7 4 − 7 3 − 7 2; 2010 – number of compositions of 12 into relatively prime parts [9]
For example, there are six divisors of 4; they are 1, 2, 4, −1, −2, and −4, but only the positive ones (1, 2, and 4) would usually be mentioned. 1 and −1 divide (are divisors of) every integer. Every integer (and its negation) is a divisor of itself. Integers divisible by 2 are called even, and integers not divisible by 2 are called odd.
240 is a pronic number, since it can be expressed as the product of two consecutive integers, 15 and 16. [1] It is a semiperfect number, [2] equal to the concatenation of two of its proper divisors (24 and 40).
For example, 6 is highly composite because d(6)=4 and d(n)=1,2,2,3,2 for n=1,2,3,4,5 respectively. A related concept is that of a largely composite number , a positive integer that has at least as many divisors as all smaller positive integers.
Graph of number of -digit polydivisible numbers in base 10 () vs estimate of (). Let be the number of digits. The function () determines the number of polydivisible numbers that has digits in base , and the function () is the total number of polydivisible numbers in base .
The first 15 superior highly composite numbers, 2, 6, 12, 60, 120, 360, 2520, 5040, 55440, 720720, 1441440, 4324320, 21621600, 367567200, 6983776800 (sequence A002201 in the OEIS) are also the first 15 colossally abundant numbers, which meet a similar condition based on the sum-of-divisors function rather than the number of divisors. Neither ...