AI & ChatGPT searches , social queriess for DIGIT SUM
Search references for DIGIT SUM. Phrases containing DIGIT SUM
See searches and references containing DIGIT SUM!
Search references for DIGIT SUM. Phrases containing DIGIT SUM
See searches and references containing DIGIT SUM!DIGIT SUM
Sum of a number's digits
In mathematics, the digit sum of a natural number in a given number base is the sum of all its digits. For example, the digit sum of the decimal number
Digit_sum
Repeated sum of a number's digits
repeated digital sum) of a natural number in a given radix is the (single digit) value obtained by an iterative process of summing digits, on each iteration
Digital_root
Arithmetic procedure of verifying operations using modulo characteristics of digit 9
procedures: Adding the decimal digits of a positive whole number, while optionally ignoring any 9s or digits which sum to 9 or a multiple of 9. The result
Casting_out_nines
Munchausen number
number in a given number base b {\displaystyle b} that is equal to the sum of its digits each raised to the power of itself. An example in base 10 is 3435
Perfect digit-to-digit invariant
Perfect_digit-to-digit_invariant
Number equal to the product of the sum and product of its digits
A sum-product number in a given number base b {\displaystyle b} is a natural number that is equal to the product of the sum of its digits and the product
Sum-product_number
Number divisible only by 1 and itself
million digits. The Electronic Frontier Foundation also offers $150,000 and $250,000 for primes with at least 100 million digits and 1 billion digits, respectively
Prime_number
Integer divisible by sum of its digits
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 in base n are also known
Harshad_number
Figurate number
visually demonstrated in the following sum, which represents T 4 + T 5 = 5 2 {\displaystyle T_{4}+T_{5}=5^{2}} as digit sums: 4 3 2 1 + 1 2 3 4 5 5 5 5 5 5 {\displaystyle
Triangular_number
Recursive integer sequence
digits greater than p + 1/2; also count digits equal to p + 1/2 unless final; and count digits equal to p − 1/2 if not final and the next digit
Catalan_number
Number equal to the sum of its proper divisors
number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number itself
Perfect_number
Simple checksum formula
exceeds 9, subtract 9 from the digit. Sum all the resulting digits (including the ones that were not doubled). The check digit is calculated by ( 10 − ( s
Luhn_algorithm
Two raised to an integer power
sum of all n-choose binomial coefficients is equal to 2n. Consider the set of all n-digit binary integers. Its cardinality is 2n. It is also the sums
Power_of_two
Numbers obtained by adding the two previous ones
mathematics, the Fibonacci sequence is a sequence in which each element is the sum of the two elements that precede it. Numbers that are part of the Fibonacci
Fibonacci_sequence
Product of an integer with itself
an even digit followed by a 1; if the last digit of a number is 2 or 8, its square ends in an even digit followed by a 4; if the last digit of a number
Square_number
Prime number of the form 2^n – 1
{\displaystyle e^{\gamma }\cdot \log _{2}(10)\approx 5.92} primes p with n decimal digits for which Mp is prime. Here, γ is the Euler–Mascheroni constant. It is also
Mersenne_prime
Iterative algorithm on numbers
α {\displaystyle \alpha } and β {\displaystyle \beta } have the same digit sum and hence the same remainder modulo b − 1 {\displaystyle b-1} . Therefore
Kaprekar's_routine
Number that is the result of operation on its own digits
numeral system, is the result of a non-trivial expression using all its own digits in combination with any of the four basic arithmetic operators (+, −, ×
Friedman_number
Shorthand way of determining whether a given number is divisible by a fixed divisor
the sum of its digits is divisible by 3 (or 9). Adding the digits of a number up, and then repeating the process with the result until only one digit remains
Divisibility_rule
Error detection for identification numbers
A very simple check digit method would be to take the sum of all digits (digital sum) modulo 10. This would catch any single-digit error, as such an error
Check_digit
Number that remains the same when its digits are reversed
where it is written in standard notation with k+1 digits ai as: n = ∑ i = 0 k a i b i {\displaystyle n=\sum _{i=0}^{k}a_{i}b^{i}} with, as usual, 0 ≤ ai < b
Palindromic_number
Number raised to the third power
last two digits. Except for cubes divisible by 5, where only 25, 75 and 00 can be the last two digits, any pair of digits with the last digit odd can occur
Cube_(algebra)
Number, product of consecutive integers
+ 1 ) ( n + 2 ) 3 = 2 T n {\displaystyle \sum _{k=1}^{n}k(k+1)={\frac {n(n+1)(n+2)}{3}}=2T_{n}} . The sum of the reciprocals of the positive pronic numbers
Pronic_number
Type of number introduced by Mike Keith
{\displaystyle k} terms are the k {\displaystyle k} digits of n {\displaystyle n} and each subsequent term is the sum of the previous k {\displaystyle k} terms
Keith_number
Number that represents a hexagon with a dot in the center
rightmost (least significant) digits follow the pattern 1–7–9–7–1 (repeating with period 5). This follows from the last digit of the triangle numbers (sequence
Centered_hexagonal_number
Unique numeric book identifier since 1970
check digit (which is the last digit of the 10-digit ISBN) must range from 0 to 10 (the symbol 'X' is used for 10), and must be such that the sum of the
ISBN
Decrease in asset values, or the allocation of cost thereof
years' digits. Since the asset has a useful life of 5 years, the years' digits are: 5, 4, 3, 2, and 1. Next, calculate the sum of the digits: 5+4+3+2+1=15
Depreciation
Numbers with a certain property involving recursive summation
which eventually reaches 1 when the number is replaced by the sum of the square of each digit. For instance, 13 is a happy number because 1 2 + 3 2 = 10
Happy_number
Arithmetic operation
base ten (decimal) number system, integer powers of 10 are written as the digit 1 followed or preceded by a number of zeroes determined by the sign and
Exponentiation
Number that is the sum of permutations of sub-samples of their own digits
mathematics, the Digit-reassembly numbers, or Osiris numbers, are numbers that are equal to the sum of permutations of sub-samples of their own digits (compare
Digit-reassembly_number
Square of a triangular number
In number theory, the sum of the first n cubes is the square of the nth triangular number. That is, 1 3 + 2 3 + 3 3 + ⋯ + n 3 = ( 1 + 2 + 3 + ⋯ + n )
Squared_triangular_number
Integers occurring in the coefficients of the Taylor series of 1/cosh t
⋅ t n , {\displaystyle {\frac {1}{\cosh t}}={\frac {2}{e^{t}+e^{-t}}}=\sum _{n=0}^{\infty }{\frac {E_{n}}{n!}}\cdot t^{n},} where cosh ( t ) {\displaystyle
Euler_numbers
Numbers parameterizing ways to partition a set
{\displaystyle \left\{{n \atop k}\right\}={\frac {1}{k!}}\sum _{i=0}^{k}(-1)^{k-i}{\binom {k}{i}}i^{n}=\sum _{i=0}^{k}{\frac {(-1)^{k-i}i^{n}}{(k-i)!i!}}.} (See
Stirling numbers of the second kind
Stirling_numbers_of_the_second_kind
Mathematical sequences in combinatorics
{\displaystyle {\begin{aligned}\sum _{i=0}^{n}i^{4}&=\sum _{i=0}^{n}\sum _{k=0}^{4}{\biggl \{}{\!4\! \atop \!k\!}{\biggr \}}(i)_{k}=\sum _{k=0}^{4}{\biggl \{}{\
Stirling_number
Number that is less than the sum of its proper divisors
abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number. The integer 12 is the
Abundant_number
Number used for counting
Persistence Additive Multiplicative Digit sum Digit sum Digital root Self Sum-product Digit product Multiplicative digital root Sum-product Coding-related Meertens
Natural_number
Railway vehicle and coach number system
1 2 gives 4 1 16 1 4 4 14 1 4 1 14 digit sum 4 1 7 1 4 4 5 1 4 1 5 sum = 37 next multiple of ten = 40 check digit = 40-37 = 3 2 1 8 1 2 4 7 1 2 1 7 -
UIC_wagon_numbers
Number of nonzero symbols in a string
case, a given set of bits, this is the number of bits set to 1, or the digit sum of the binary representation of a given number and the ℓ₁ norm of a bit
Hamming_weight
Concept in number theory
{\displaystyle b} is a number that is the sum of its own digits each raised to the power of the number of digits. Let n {\displaystyle n} be a natural number
Narcissistic_number
Natural number
itself may be represented as a sum of distinct divisors of 888. 888 is a Harshad number as it is divisible by its sum of digits, where 888 ÷ (8, 8, 8) is 888
888_(number)
Number that cannot be written as an aliquot sum
expressed as the sum of all the proper divisors of any positive integer. That is, these numbers are not in the image of the aliquot sum function. Their
Untouchable_number
Base-dependent property of integers
constant Meertens number Narcissistic number Perfect digit-to-digit invariant Perfect digital invariant Sum-product number Iannucci (2000) D. R. Kaprekar (1980–1981)
Kaprekar_number
Integer whose multiples are digit rotations
cyclic permutations of the digits are successive integer multiples of the number. The most widely known is the six-digit number 142857, whose first six
Cyclic_number
Integer having a non-trivial divisor
Persistence Additive Multiplicative Digit sum Digit sum Digital root Self Sum-product Digit product Multiplicative digital root Sum-product Coding-related Meertens
Composite_number
Type of figurate number
− 1 ( 4 k + 1 ) {\displaystyle h_{n}=\sum _{k=0}^{n-1}{(4k+1)}} where the empty sum is taken to be 0. The sum of the reciprocal hexagonal numbers is
Hexagonal_number
Standard for international postal mail tracking numbers
+= weights[i] * int(digit) sum = 11 - (sum % 11) if sum == 10: sum = 0 elif sum == 11: sum = 5 return sum function getCheckDigit(num) { const weights
S10_(UPU_standard)
Result of multiplying four instances of a number together
A000583 in the OEIS). The last digit of a fourth power in decimal can only be 0, 1, 5, or 6. In hexadecimal the last nonzero digit of a fourth power is always
Fourth_power
Integer describing itself
have digit sums equal to their base, and that they're multiples of that base. The first fact follows trivially from the fact that the digit sum equals
Self-descriptive_number
Number, non-palindrome after repeated sum with reverse
reverse-and-add process produces the sum of a number and the number formed by reversing the order of its digits. For example, 56 + 65 = 121. As another
Lychrel_number
Positive integer of the form (2^(2^n))+1
prime. With the exception of F0 and F1, the last decimal digit of a Fermat number is 7. The sum of the reciprocals of all the Fermat numbers (sequence A051158
Fermat_number
Infinite integer series where the next number is the sum of the two preceding it
recursive relationship as the Fibonacci sequence, where each term is the sum of the two previous terms, but with different starting values. This produces
Lucas_number
Product of two prime numbers
aimed at a star cluster. It consisted of 1679 {\displaystyle 1679} binary digits intended to be interpreted as a 23 × 73 {\displaystyle 23\times 73} bitmap
Semiprime
Numbers with many divisors
composite number that is not a Harshad number is 245,044,800; it has a digit sum of 27, which does not divide evenly into 245,044,800. 10 of the first
Highly_composite_number
Natural number
number, and the fourth 18-gonal number. It is the 10th star number (whose digit sum also adds to 10 in decimal). In medieval contexts, it may be described
100
Mathematical formula
digit_product(x, b) return len(seen) - 1 Arithmetic dynamics Digit sum Digital root Sum-product number Weisstein, Eric W. "Multiplicative Digital Root"
Multiplicative_digital_root
Concatenation of the first n prime numbers
three are 2, 23 and 2357 (sequence A069151 in the OEIS). The fourth is 355 digits long: it is the result of concatenating the first 128 prime numbers, through
Smarandache–Wellin_number
Property of a number
the number by the sum or product of its digits until one reaches a single digit. Because the numbers are broken down into their digits, the additive or
Persistence_of_a_number
Type of natural number
number that cannot be written as the sum of any other natural number n {\displaystyle n} and the individual digits of n {\displaystyle n} . 20 is a self
Self_number
Number of stacked spheres in a pyramid
polygon. They equal the sums of consecutive tetrahedral numbers, and are one-fourth of a larger tetrahedral number. The sum of two consecutive square
Square_pyramidal_number
Numbers k where x - phi(x) = k has many solutions
Persistence Additive Multiplicative Digit sum Digit sum Digital root Self Sum-product Digit product Multiplicative digital root Sum-product Coding-related Meertens
Highly_cototient_number
Polyhedral number representing a tetrahedron
i = 1 k i ) {\displaystyle Te_{n}=\sum _{k=1}^{n}T_{k}=\sum _{k=1}^{n}{\frac {k(k+1)}{2}}=\sum _{k=1}^{n}\left(\sum _{i=1}^{k}i\right)} The tetrahedral
Tetrahedral_number
Pair of integers related by their divisors
that the sum of the proper divisors of each is equal to the other number. That is, s(a)=b and s(b)=a, where s(n)=σ(n) − n is equal to the sum of positive
Amicable_numbers
Barcode system for tracking trade items
equation, then it is not a valid UPC-A. The UPC-A check digit may be calculated as follows: Sum the digits at odd-numbered positions (first, third, fifth,..
Universal_Product_Code
Result of multiplying five instances of a number together
in the OEIS) For any integer n, the last decimal digit of n5 is the same as the last (decimal) digit of n, i.e. n ≡ n 5 ( mod 10 ) {\displaystyle n\equiv
Fifth_power_(algebra)
Number whose sums of distinct divisors represent all smaller numbers
{\displaystyle n} such that all smaller positive integers can be represented as sums of distinct divisors of n {\displaystyle n} . For example, 12 is a practical
Practical_number
Integer whose representation contains every digit in its number base
pandigital number can be a prime number if it doesn't have redundant digits. The sum of the digits 0 to 9 is 45, passing the divisibility rule for both 3 and 9
Pandigital_number
Function whose domain is the positive integers
{\displaystyle \sum _{p^{k}}f(p^{k})=\sum _{p}\sum _{k>0}f(p^{k})=f(2)+f(3)+f(4)+f(5)+f(7)+f(8)+f(9)+\cdots .} The notations ∑ d ∣ n f ( d ) {\textstyle \sum _{d\mid
Arithmetic_function
Natural number
9, 10 and 13. the only number in decimal whose square root equals its digit sum, both being 9. More generally, for any base b > 1 {\displaystyle b>1}
81_(number)
Figurate number
formula for the sum of the reciprocals of the pentagonal numbers is given by ∑ n = 1 ∞ 2 n ( 3 n − 1 ) = 3 ln ( 3 ) − π 3 . {\displaystyle \sum _{n=1}^{\infty
Pentagonal_number
Natural number with a decimal representation made of repeated instances of the same digit
instances of the same digit in a positional number system (often implicitly decimal). The word is a portmanteau of "repeated" and "digit". Examples are 11
Repdigit
Type of Poulet number
Persistence Additive Multiplicative Digit sum Digit sum Digital root Self Sum-product Digit product Multiplicative digital root Sum-product Coding-related Meertens
Super-Poulet_number
bits sum xor8 8 bits sum Luhn algorithm 1 decimal digit sum Verhoeff algorithm 1 decimal digit sum Damm algorithm 1 decimal digit Quasigroup operation
List_of_hash_functions
Numbers whose prime factors all divide the number more than once
uniquely defined by this property. The sum of the reciprocals of the powerful numbers converges. The value of this sum may be written in several other ways
Powerful_number
Count of the possible partitions of a set
( k i ) i n , {\displaystyle B_{n}=\sum _{k=0}^{n}\left\{{n \atop k}\right\}=\sum _{k=0}^{n}{\frac {1}{k!}}\sum _{i=0}^{k}(-1)^{k-i}{\binom {k}{i}}i^{n}
Bell_number
Class of binary number
partition of these numbers into two sets that have equal multisets of pairwise sums. As 19th-century mathematician Eugène Prouhet showed, the partition into
Evil_number
Mexican banking standard
18 digits of the CLABE follows this structure: 3 Digits: Bank Code 3 Digits: Branch Office Code 11 Digits: Account Number 1 Digit : Control Digit In Mexico
CLABE
Numbers that evenly divide powers of 60
Babylonian notational conventions did not specify the power of the starting digit. Conversely 1/4000 = 54/603, so division by 1:6:40 = 4000 can be accomplished
Regular_number
Integer having only small prime factors
although that name has other more widely used meanings, most notably for the sum of the reciprocals of the natural numbers. 5-smooth numbers are also called
Smooth_number
Type of composite integer
composite number for which, in a given number base, the sum of its digits is equal to the sum of the digits in its prime factorization in the same base. In the
Smith_number
Abundant number whose proper divisors are all deficient numbers
abundant number because: The sum of its proper divisors is 1 + 2 + 4 + 5 + 10 = 22, so 20 is an abundant number. The sums of the proper divisors of 1,
Primitive_abundant_number
Numbers that contain only the digit 1
mathematics, a repunit is a number like 11, 111, or 1111 that contains only the digit 1 — a more specific type of repdigit. The term stands for "repeated unit"
Repunit
Number that is the sum of the factorials of its digits
b {\displaystyle b} is a natural number that equals the sum of the factorials of its digits. The name factorion was coined by the author Clifford A.
Factorion
Number equal to the sum of all or some of its divisors
is a natural number n equal to the sum of all or some of its proper divisors. A semiperfect number equal to the sum of all its proper divisors is a perfect
Semiperfect_number
Integer filtered out using a sieve similar to that of Eratosthenes
Persistence Additive Multiplicative Digit sum Digit sum Digital root Self Sum-product Digit product Multiplicative digital root Sum-product Coding-related Meertens
Lucky_number
Positive integer that is an integer power of another positive integer
{\displaystyle \sum _{m=2}^{\infty }\sum _{k=2}^{\infty }{\frac {1}{m^{k}}}=\sum _{m=2}^{\infty }{\frac {1}{m^{2}}}\sum _{k=0}^{\infty }{\frac {1}{m^{k}}}=\sum _{m=2}^{\infty
Perfect_power
Natural number
decks.[citation needed] A natural number is divisible by 3 if the sum of its digits in base 10 is also divisible by 3. This known as the divisibility
3
Number whose square ends in the same digits
same digits as the number itself. Given a number base b {\displaystyle b} , a natural number n {\displaystyle n} with k {\displaystyle k} digits is an
Automorphic_number
Mathematical concept
Persistence Additive Multiplicative Digit sum Digit sum Digital root Self Sum-product Digit product Multiplicative digital root Sum-product Coding-related Meertens
Lucky_numbers_of_Euler
Natural number
8th member, as the sum of the preceding terms in the sequence 8 and 13) whose digits (2, 1) are Fibonacci numbers and whose digit sum is also a Fibonacci
21_(number)
Natural number
upside down on a calculator display). It is one of the numbers whose digit sum in decimal is the same as it is in binary. 222 is a noncototient, meaning
222_(number)
Topics referred to by the same term
digital sum: The digit sum - add the digits of the representation of a number in a given base. For example, considering 84001 in base 10 the digit sum would
Digital_sum
Number that has fewer digits than the number of digits in its prime factorization
is a natural number in a given number base that has fewer digits than the number of digits in its prime factorization in the given number base (including
Extravagant_number
Composite number in number theory
prove that a Carmichael number is, in fact, composite. Arnault gives a 397-digit Carmichael number N {\displaystyle N} that is a strong pseudoprime to all
Carmichael_number
Three raised to an integer power
In number theory, all powers of three are perfect totient numbers. The sums of distinct powers of three form a Stanley sequence, the lexicographically
Power_of_three
Sequence in number theory
number equal to the perfect cube of another natural number such that the digit sum of the first natural number is equal to the second. The name derives from
Dudeney_number
Type of figurate number constructed by combining heptagons
= ( 10 n − 3 ) 2 {\displaystyle 40H_{n}+9=(10n-3)^{2}} A formula for the sum of the reciprocals of the heptagonal numbers is given by: ∑ n = 1 ∞ 2 n (
Heptagonal_number
Number of dots in a centred dot square
square number is the sum of successive squares. All centered square numbers are odd, and in base 10 one can notice the one's digit follows the pattern
Centered_square_number
Number that has a perfect number of factors adding up to another perfect number
− 1) (sequence A081357 in the OEIS). The second of these has 76 decimal digits: 6,086,555,670,238,378,989,670,371,734,243,169,622,657,830,773,351,885,970
Sublime_number
Number of form 2^(2^p-1)-1 with prime exponent
Persistence Additive Multiplicative Digit sum Digit sum Digital root Self Sum-product Digit product Multiplicative digital root Sum-product Coding-related Meertens
Double_Mersenne_number
Type of natural number
sense, has many divisors. Particularly, it is defined by a ratio between the sum of an integer's divisors and that integer raised to a power higher than one
Colossally_abundant_number
Formula for computing the nth base-16 digit of π
(hexadecimal) digit of π (and therefore also the 4nth binary digit of π) without computing the preceding digits. This does not compute the nth decimal digit of π
Bailey–Borwein–Plouffe formula
Bailey–Borwein–Plouffe_formula
DIGIT SUM
DIGIT SUM
Boy/Male
Tamil
Girl/Female
Indian
Immortal
Girl/Female
Bengali, Gujarati, Hindu, Indian, Malayalam, Sanskrit
Progressive; A Digit of the Moon
Surname or Lastname
English
English : variant of Sumpter.Fort Sumter, SC, was named in honor of Thomas Sumter, known as the ‘Gamecock of the Revolution’ for the fear he inspired in the British and Tory forces and the pivotal role he played in key American victories. Born in 1734 near Charlottesville, VA, he was of Welsh heritage; his ancestors probably emigrated to America in the late 17th century.
Boy/Male
Hindu
Full of Joy, Mountain strength, Ireland, Peace, Sun Ray (Celebrity Name: Madhuri Dixit)
Boy/Male
Tamil
Immortal
Surname or Lastname
English
English : occupational name for a carrier, from Middle English sum(p)ter ‘(driver of a) pack animal’.
Girl/Female
Hindu
Digit of the Moon
Boy/Male
Hindu
Surname or Lastname
English
English : occupational name for a summoner, an official who was responsible for ensuring the appearance of witnesses in court, Middle English sumner, sumnor.William Sumner came to Dorchester, MA, from England in about 1635. His descendants include U.S. Senator Charles Sumner, a major force in the struggle to end slavery, who was born in 1811 in Boston.
Surname or Lastname
English
English : variant of Dimmitt.
Girl/Female
Tamil
Indukala | இஂதà¯à®•à®²à®¾
Digit of the Moon
Indukala | இஂதà¯à®•à®²à®¾
Boy/Male
Tamil
Ryan is An Irish baby name that means king (Celebrity Name: Madhuri Dixit)
Boy/Male
Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Punjabi, Sanskrit, Sindhi, Telugu
Immortal; Lord Shiva
Girl/Female
Muslim
Fruit, Summer fruit
Girl/Female
Hindu, Indian
Giving Honour; A Digit of the Moon
Boy/Male
Indian, Sanskrit
Digit of the Moon
Surname or Lastname
English
English : variant or patronymic form of Sumner.
Boy/Male
Hindu
Ryan is An Irish baby name that means king (Celebrity Name: Madhuri Dixit)
Boy/Male
Tamil
Full of Joy, Mountain strength, Ireland, Peace, Sun Ray (Celebrity Name: Madhuri Dixit)
DIGIT SUM
DIGIT SUM
Girl/Female
Indian, Tamil
Soft
Boy/Male
Hindu
Humble boy, Modest, Leader
Male
Egyptian
, the father of Taspu.
Surname or Lastname
English
English : variant of Woolen.Norwegian : habitational name from any of numerous farmsteads named Vollen, from the definite singular form of voll ‘meadow’ (see Voll).
Girl/Female
Arabic, Muslim
Compassionate; Merciful; Affectionate; Tender-hearted; Soft-hearted
Surname or Lastname
English (London)
English (London) : habitational name from places in Suffolk and Sussex, named in Old English with pere ‘pear’ + hÄm ‘homestead’.
Girl/Female
Tamil
Celestial
Boy/Male
Arabic, Muslim
Sincerity; Love; Purity
Boy/Male
British, English, German
Mountain
Girl/Female
Australian, Japanese
Child of Yuka
DIGIT SUM
DIGIT SUM
DIGIT SUM
DIGIT SUM
DIGIT SUM
imp. & p. p.
of Dight
n.
One of the ten figures or symbols, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, by which all numbers are expressed; -- so called because of the use of the fingers in counting and computing.
n.
The third or middle finger; the third digit, or that which corresponds to it.
v. t.
To prepare; to put in order; hence, to dress, or put on; to array; to adorn.
n.
One of the terminal divisions of a limb appendage; a finger or toe.
n.
One twelfth part of the diameter of the sun or moon; -- a term used to express the quantity of an eclipse; as, an eclipse of eight digits is one which hides two thirds of the diameter of the disk.
n.
The second digit, that next pollex, in the manus, or hand; the forefinger; index finger.
v. t.
To point at or out with the finger.
v. t.
To dismiss, let go, or release.
n.
An animal having only two digits.
n.
A finger or toe; a digit.
n.
A character or symbol representing a number; a numeral; a digit; as, 1, 2,3, etc.
n.
An extra first digit, or rudiment of a digit, on the preaxial side of the pollex.
n.
The possession of more that the normal number of digits.
p. pr. & vb. n.
of Dight
a.
Having only two digits; two-toed.
n.
A finger's breadth, commonly estimated to be three fourths of an inch.
a.
Having five digits to the hand or foot.
v. t.
To have sexual intercourse with.