Search results
Results from the WOW.Com Content Network
The basic rule for divisibility by 4 is that if the number formed by the last two digits in a number is divisible by 4, the original number is divisible by 4; [2] [3] this is because 100 is divisible by 4 and so adding hundreds, thousands, etc. is simply adding another number that is divisible by 4. If any number ends in a two digit number that ...
divisible by the value of its φ function, which is 36. divisible by the total number of its divisors (12), hence it is a refactorable number. the angle in degrees of the interior angles of a regular pentagon in Euclidean space. palindromic in bases 11 (99 11), 17 (66 17), 26 (44 26), 35 (33 35) and 53 (22 53)
a primitive abundant number is an abundant number whose proper divisors are all deficient numbers or they are "abundant" numbers with no abundant proper divisors; a weird number is an abundant number that is not semiperfect; that is, no subset of the proper divisors of n sum to n
Aside from being the smallest square triangular number other than 1, it is also the only triangular number (other than 1) whose square root is also a triangular number. 36 is also the eighth refactorable number, as it has exactly nine positive divisors, and 9 is one of them; [3] in fact, it is the smallest positive integer with at least nine ...
Demonstration, with Cuisenaire rods, of the first four highly composite numbers: 1, 2, 4, 6. A highly composite number is a positive integer that has more divisors than all smaller positive integers. If d(n) denotes the number of divisors of a positive integer n, then a positive integer N is highly composite if d(N) > d(n) for all n < N.
Such a number is a divisor of (⌈ / ⌉,,). The regular numbers are also called 5-smooth, indicating that their greatest prime factor is at most 5. [2] More generally, a k-smooth number is a number whose greatest prime factor is at most k. [3] The first few regular numbers are [2]
33 is the 21st composite number, and 8th distinct semiprime (third of the form where is a higher prime). [1] It is one of two numbers to have an aliquot sum of 15 = 3 × 5 — the other being the square of 4 — and part of the aliquot sequence of 9 = 3 2 in the aliquot tree (33, 15, 9, 4, 3, 2, 1).
A multiple of a number is the product of that number and an integer. For example, 10 is a multiple of 5 because 5 × 2 = 10, so 10 is divisible by 5 and 2. Because 10 is the smallest positive integer that is divisible by both 5 and 2, it is the least common multiple of 5 and 2.