8703
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12584
- Proper Divisor Sum (Aliquot Sum)
- 3881
- 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
- 5796
- Möbius Function
- 0
- Radical
- 2901
- 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
- 109
- Smith Number
- no
- Vampire 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
Appears in sequences
- Number of partitions satisfying cn(0,5) + cn(1,5) + cn(4,5) < cn(2,5) + cn(3,5).at n=38A039880
- Bessel function Y_0(n) is a monotonically decreasing positive sequence.at n=20A046961
- Bessel function |Y_0(n)| is a monotonically decreasing positive sequence.at n=34A046963
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (0 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of z.at n=15A050787
- Number of stacked directed animals on the square lattice.at n=8A059712
- Interprimes which are of the form s*prime, s=9.at n=24A075284
- Expansion of (1-x)^(-1)/(1-2*x+2*x^2-2*x^3).at n=19A077858
- Indices k where A057176(k) = 1.at n=8A087045
- Triangular matrix, read by rows, that satisfies: T(n,k) = [T^2](n-1,k) when n>k>=0, with T(n,n) = (n+1).at n=23A102086
- A sequence of asymptotic density zeta(10) - 1, where zeta is the Riemann zeta function.at n=8A143036
- Triangle read by rows where T(n,k) is the number of factorizations of (n+1)! into k distinct factors.at n=63A157836
- a(n) = 512n - 1.at n=16A158011
- a(n) = 256*n - 1.at n=33A158250
- a(n) = 34*n^2 - 1.at n=15A158588
- Number of symmetry classes of 3 X 3 magilatin squares with positive values and magic sum n.at n=44A173730
- Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=15A192962
- a(n) = 17*2^n - 1.at n=9A198275
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210202; see the Formula section.at n=49A210201
- 18k^2-36k+9 interleaved with 18k^2-18k+9 for k>=0.at n=46A216852
- Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,3,9, Q starts with 2,6, R starts with 4; at each stage the smallest number not yet present in P,Q,R is appended to R. Sequence gives P.at n=32A225385