8710
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17136
- Proper Divisor Sum (Aliquot Sum)
- 8426
- 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
- 3168
- Möbius Function
- 1
- Radical
- 8710
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Odd
- no
Appears in sequences
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 2), t = (Fibonacci numbers).at n=15A024309
- a(n) = [ 1/(2*t(n+1) - t(n) - t(n+2)) ], where t(n) = tan(Pi/2 - 1/n) satisfies n-1 < t(n) < n for all n >= 1.at n=16A024817
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 2), t = (Fibonacci numbers).at n=14A024872
- Denominators of continued fraction convergents to sqrt(272).at n=5A041511
- Numerators of continued fraction convergents to sqrt(668).at n=5A042284
- a(n) = T(2n-1,n), array T given by A048201.at n=46A048208
- Expansion of (1+x^2*C^2)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=7A071723
- Number of compositions (ordered partitions) of n such that some part is repeated consecutively 3 times and no part is repeated consecutively more than 3 times.at n=13A091617
- Number of partitions of n such that largest part k occurs at least floor(k/2) times.at n=53A118083
- Triangle, read by rows, equal to the matrix 4th power of triangle A136220.at n=32A136232
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 0, 0), (0, 1, 1), (1, -1, -1)}.at n=10A148214
- Half the number of length n integer sequences with sum zero and sum of squares 1682.at n=3A157561
- Numbers n such that 4n+3 is a palindromic prime.at n=30A193419
- a(n) is the smallest number which is the sum of two positive n-gonal numbers in more than one way.at n=12A199809
- O.g.f. satisfies: A(x) = Sum_{n>=0} n^n * x^n*A(n*x)^(3*n)/n! * exp(-n*x*A(n*x)^3).at n=5A218674
- -2-Knödel numbers.at n=25A225506
- Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 6.at n=12A244707
- Expansion of Product_{k>=1} 1/(1-x^(3*k-2))^(3*k-2).at n=27A262947
- Alternating sum of 9-gonal (or decagonal) pyramidal numbers.at n=24A269440
- Expansion of (1-sqrt(1-4*x^4/(1-x)^4))/(2*x^4*(1-x)).at n=11A270784