873
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 1274
- Proper Divisor Sum (Aliquot Sum)
- 401
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 576
- Möbius Function
- 0
- Radical
- 291
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 147
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- achthundertdreiundsiebzig· ordinal: achthundertdreiundsiebzigste
- English
- eight hundred seventy-three· ordinal: eight hundred seventy-third
- Spanish
- ochocientos setenta y tres· ordinal: 873º
- French
- huit cent soixante-treize· ordinal: huit cent soixante-treizième
- Italian
- ottocentosettantatre· ordinal: 873º
- Latin
- octingenti septuaginta tres· ordinal: 873.
- Portuguese
- oitocentos e setenta e três· ordinal: 873º
Appears in sequences
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=26A000232
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=24A000232
- a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=12A001209
- Divisors of 2^48 - 1.at n=42A003553
- Triangular numbers written backwards.at n=27A004158
- a(n) = Sum_{k=1..n} k!.at n=6A007489
- Coordination sequence T3 for Zeolite Code BOG.at n=21A008051
- Coordination sequence T3 for Zeolite Code FER.at n=18A008108
- a(n) = floor(binomial(n,5)/5).at n=16A011851
- arctan(sinh(x)+arctan(x))=2*x-17/3!*x^3+873/5!*x^5-110799/7!*x^7...at n=2A013060
- arctanh(arcsinh(x)+tan(x)) = 2*x+17/3!*x^3+873/5!*x^5+110127/7!*x^7...at n=2A013099
- Carlitz-Riordan q-Catalan numbers (recurrence version) for q=-2.at n=5A015097
- Expansion of g.f. x/(1 - 9*x - 8*x^2).at n=4A015584
- Expansion of e.g.f. theta_3^(-3/2).at n=4A015682
- Positive integers n such that 2^n (mod n) == 2^9 (mod n).at n=46A015931
- Divisors of 873.at n=5A018695
- Pseudoprimes to base 64.at n=38A020192
- Pseudoprimes to base 98.at n=13A020226
- Numbers k such that the continued fraction for sqrt(k) has period 18.at n=18A020357
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly ten 1's.at n=38A020446