7086
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14184
- Proper Divisor Sum (Aliquot Sum)
- 7098
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2360
- Möbius Function
- -1
- Radical
- 7086
- 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
- 57
- 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
- Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=7A003447
- Numbers k such that k | 9^k + 9.at n=11A015898
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 10.at n=15A022315
- Expansion of 1/((1-3*x)*(1-5*x)*(1-7*x)*(1-12*x)).at n=3A028063
- Number of partitions satisfying cn(1,5) < cn(0,5) + cn(2,5) + cn(3,5) and cn(4,5) < cn(0,5) + cn(2,5) + cn(3,5).at n=34A039872
- Numbers whose base-4 representation contains exactly four 2's and two 3's.at n=22A045155
- Numbers k such that 8^k == -1 (mod k-1).at n=12A055691
- E.g.f.: ((1-x)/(1-2*x)) * exp(x*(1-x)/(1-2*x)).at n=5A059281
- Number of distinct Markov type classes of order 5 possible in binary strings of length n.at n=8A132300
- a(n) = (n^4 + 46*n^3 - 169*n^2 + 146*n + 24)/24.at n=13A143059
- A121153 \ A005836.at n=6A170830
- Sums of 3 consecutive semiprimes.at n=30A173968
- Sums of three consecutive numbers each of which is the product of two distinct primes and each of which has no exponent greater than one for either of its two prime factors.at n=28A173969
- Number of nX7 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=2A208687
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=38A208688
- Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=6A208689
- Number of nX7 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 1 0 vertically.at n=2A208839
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 1 0 vertically.at n=38A208840
- Number A(n,k) of solid standard Young tableaux of n cells and height <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=63A215086
- Number of solid standard Young tableaux of n cells and height <= 2.at n=8A215087