885
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1440
- Proper Divisor Sum (Aliquot Sum)
- 555
- 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
- 464
- Möbius Function
- -1
- Radical
- 885
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 116
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- achthundertfünfundachtzig· ordinal: achthundertfünfundachtzigste
- English
- eight hundred eighty-five· ordinal: eight hundred eighty-fifth
- Spanish
- ochocientos ochenta y cinco· ordinal: 885º
- French
- huit cent quatre-vingt-cinq· ordinal: huit cent quatre-vingt-cinqième
- Italian
- ottocentoottantacinque· ordinal: 885º
- Latin
- octingenti octoginta quinque· ordinal: 885.
- Portuguese
- oitocentos e oitenta e cinco· ordinal: 885º
Appears in sequences
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives A(A000099(n)).at n=13A000323
- A Fielder sequence. a(n) = a(n-1) + a(n-3) + a(n-4) + a(n-5), n >= 6.at n=12A001639
- Numbers k such that (k^2 + k + 1)/19 is prime.at n=28A002643
- a(n) = a(n-1) + a(n-2) - a(n-3).at n=34A002798
- P-positions in Epstein's Put or Take a Square game.at n=26A005240
- Numbers m such that 4*3^m + 1 is prime.at n=10A005537
- a(n) = n*(n + 1)*(n^2 - 3*n + 5)/6.at n=9A006484
- a(n) = (25*n^4-120*n^3+209*n^2-108*n)/6.at n=5A006529
- 9-gonal (or enneagonal) pyramidal numbers: a(n) = n*(n+1)*(7*n-4)/6.at n=9A007584
- Coordination sequence T1 for Zeolite Code ATV.at n=19A008043
- Coordination sequence T1 for Zeolite Code MFI.at n=19A008161
- Expansion of (1+x^9)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=39A008770
- a(n) = floor(n*(n-1)*(n-2)/12).at n=23A011894
- sec(sec(x)*arcsin(x))=1+1/2!*x^2+21/4!*x^4+885/6!*x^6+67753/8!*x^8...at n=3A012793
- a(n) = n^2 - floor( n/2 ).at n=30A014848
- a(n) = Sum_{i=1..n} phi(i) * (ceiling(n/i) - floor(n/i)).at n=54A015613
- Number of 4's in all the partitions of n into distinct parts.at n=45A015739
- Number of partitions of n into distinct parts, none being 4.at n=42A015746
- Numbers n such that phi(n) | sigma_7(n).at n=35A015765
- Divisors of 885.at n=7A018702