Smaller+number
51Harmonic divisor number — This article is about harmonic divisor numbers. For meanings of harmonic number, see harmonic number (disambiguation). In mathematics, a harmonic divisor number, or Ore number (named after Øystein Ore who defined it in 1948), is a positive… …
52Palindromic number — A palindromic number or numeral palindrome is a symmetrical number like 16461, that remains the same when its digits are reversed. The term palindromic is derived from palindrome, which refers to a word like rotor that remains unchanged under… …
53The Number of the Beast (album) — For the Biblical meaning, see Number of the Beast. The Number of the Beast Studio album by Iron Maiden …
54Graham's number — Graham s number, named after Ronald Graham, is a large number that is an upper bound on the solution to a certain problem in Ramsey theory. This number gained a degree of popular attention when Martin Gardner described it in the Mathematical… …
5530 (number) — ← 29 31 → 30 ← 30 31 32 33 34 35 36 …
5672 (number) — ← 71 73 → 72 ← 70 71 72 73 74 75 76 …
57Harshad number — A Harshad number, or Niven number in a given number base, is an integer that is divisible by the sum of its digits when written in that base. Harshad numbers were defined by D. R. Kaprekar, a mathematician from India. The word Harshad comes from… …
58Practical number — In mathematics, and in particular number theory, a practical number or panarithmic number is a positive integer n such that all smaller positive integers can be represented as sums of distinct divisors of n . For example, 12 is a practical number …
59Coordination number — In chemistry and crystallography, the coordination number of a central atom in a molecule or crystal is the number of its nearest neighbours. This number is determined somewhat differently for molecules and for crystals. In chemistry, the… …
60Intersection number (graph theory) — In the mathematical field of graph theory, the intersection number of a graph is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover… …
