869
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 960
- Proper Divisor Sum (Aliquot Sum)
- 91
- 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
- 780
- Möbius Function
- 1
- Radical
- 869
- Omega Function (Ω)
- 2
- 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
- 28
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- achthundertneunundsechzig· ordinal: achthundertneunundsechzigste
- English
- eight hundred sixty-nine· ordinal: eight hundred sixty-ninth
- Spanish
- ochocientos sesenta y nueve· ordinal: 869º
- French
- huit cent soixante-neuf· ordinal: huit cent soixante-neufième
- Italian
- ottocentosessantanove· ordinal: 869º
- Latin
- octingenti sexaginta novem· ordinal: 869.
- Portuguese
- oitocentos e sessenta e nove· ordinal: 869º
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=30A000232
- Numbers in which every digit contains at least one loop (version 1).at n=39A001743
- Number of pairs of consecutive integers x, x+1 such that all prime factors of both x and x+1 are at most the n-th prime.at n=12A002071
- a(n) = -1 + a(0)*a(1)*...*a(n-1) with a(0) = 3.at n=4A005267
- Number of points on surface of square pyramid: 3*n^2 + 2 (n>0).at n=17A005918
- Coefficients of the '2nd-order' mock theta function A(q).at n=22A006304
- Number of n-node graphs with no cycles of length less than 5.at n=9A006787
- Generated by a sieve: keep first number, drop every 2nd, keep first, drop every 3rd, keep first, drop every 4th, etc.at n=51A007952
- Coordination sequence T1 for Zeolite Code AWW.at n=21A008045
- Coordination sequence T3 for Zeolite Code MTW.at n=19A008198
- Crystal ball sequence for A_7 lattice.at n=2A008390
- Molien series for A_6.at n=27A008629
- Coordination sequence T1 for Zeolite Code -PAR.at n=21A009855
- a(n) = a(n-1)+a(n-4).at n=20A014097
- a(n) = (n+2)*(n+1)*(n^2 + 7*n - 12)/24.at n=9A014309
- a(n) = Sum_{k=1..n-1} ceiling(k^2/n).at n=50A014811
- Numbers k such that phi(k + 11) | sigma(k).at n=29A015831
- Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=21A015994
- Expansion of 1/(1-x^6-x^7-x^8-x^9).at n=47A017849
- X^m=X rings without normal forms: integers m > 1 for which there exist a prime p and integers a,b > 0 such that both p^a-1 and p^b-1 divide m-1 but p^lcm(a,b)-1 does not divide m-1.at n=49A019508