8164
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15484
- Proper Divisor Sum (Aliquot Sum)
- 7320
- 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
- 3744
- Möbius Function
- 0
- Radical
- 4082
- Omega Function (Ω)
- 4
- 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
- 65
- 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
- yes
- Odd
- no
Appears in sequences
- Convolution of Fibonacci numbers and primes.at n=14A023615
- Ranks of certain relations among Euler sums of weight n.at n=12A038360
- Number of ordered pairs of complementary subsets of an n-set with both subsets of cardinality at least 2.at n=13A052515
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n+1,0)=A006319(n)=a(n,0) + Sum a(k,k), k=0..n-1. a(n,m+1)= a(n,0) + Sum A006319(k)*a(n-k-1,0), k=0..m-1.at n=29A073151
- pi(n) is a power of 2, where pi(n) = A000720(n) is the number of primes <= n.at n=40A073798
- a(n)=floor{square((1*n^0+1*n^1+2*n^2+4*n^3)/(1*n^0+2*n^1+1*n^2))}.at n=23A086863
- Let A denote the sequence; then A is equal to the union of the self-convolutions A^2 and A^4, with terms in ascending order by size, where a(0)=1.at n=24A090847
- a(n) = (p^2 - 1) / 12, where p is the n-th prime of the form 4*k+1.at n=29A109255
- Shadow of sqrt(2).at n=45A110557
- Numbers k such that the concatenation of k with 9*k gives a square.at n=1A115553
- Numbers n such that A117731(n) differs from A082687(n).at n=44A125740
- a(n) = n-th prime * n-th nonprime.at n=36A127118
- Concatenation of first two digits and last two digits of n-th even superperfect number A061652(n).at n=10A138869
- Record differences for n^2 - phi(n)*sigma(n).at n=27A164876
- Numbers k such that 9*k! + 1 is prime.at n=23A180626
- T(n,k)=Number of n-step one or two space at a time bishop's tours on a kXk board summed over all starting positions.at n=58A187046
- Number of 4-step one or two space at a time bishop's tours on an n X n board summed over all starting positions.at n=7A187048
- a(n) = n*Fibonacci(n) - Sum_{i=0..n-1} Fibonacci(i).at n=15A190062
- The number of ways of putting n labeled items into k labeled boxes so that each box receives at least 2 objects.at n=37A200091
- a(n) = 2^(n-5) - A000931(n).at n=13A216714