8785
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 3311
- 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
- 6000
- Möbius Function
- -1
- Radical
- 8785
- 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
- 140
- Smith Number
- no
- Vampire 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
Appears in sequences
- Powers of cube root of 7 rounded down.at n=14A017994
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor( n/2 ), s = natural numbers >= 3.at n=41A024875
- a(n) = Sum_{k=0..floor(n/2)} T(n-k,k), T given by A026780.at n=16A026790
- Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 2,1,1.at n=4A037557
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=16A066509
- Number of polyiamonds with n cells, without holes.at n=12A070765
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,0,2}.at n=34A080001
- a(n) = 15*n^2 + 6*n + 1.at n=24A080861
- Numbers k such that k*(k+7) gives the concatenation of two numbers m and m-3.at n=3A116269
- Generalized Catalan triangle of Riordan type, called C(1,3).at n=31A116866
- Low point in segment n of A079051.at n=37A117518
- Lenny Conundrum #168: Neopet species in alphabetical order, converted to digits by the phone keypad code.at n=49A119568
- Numbers k such that the numerator of Sum_{j=1..k} k^2/(2*j*(j+k)) is prime.at n=42A125745
- A106486-encodings of combinatorial games with value 1.at n=39A125992
- Egyptian fraction representation for the cube root of 62.at n=4A132537
- Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)).at n=30A134602
- Expansion of 1/(1 - x^3 - x^4 + x^7 - x^10 - x^11 + x^14) (a Salem polynomial).at n=57A143644
- G.f. satisfies: A(x) = Sum_{n>=0} x^n * A(2^n*x)^n.at n=5A158888
- Number of (n+1)X(1+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=40A232825
- Number of length 2+2 0..n arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero.at n=19A250321