13672
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25650
- Proper Divisor Sum (Aliquot Sum)
- 11978
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6832
- Möbius Function
- 0
- Radical
- 3418
- Omega Function (Ω)
- 4
- 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
- 58
- 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
- Expansion of 1/((1+x)*(1-x)^11).at n=7A001786
- Number of 3's in n-th term of A022482.at n=37A022486
- Shifts left under "BFJ" (reversible, size, labeled) transform.at n=8A032042
- Meandric numbers for a river (or directed line) crossing two perpendicular roads at n points, beginning in the (-,-) quadrant and ending in the (+,+) quadrant if n even, in the (+,-) quadrant if n odd.at n=11A076906
- Meandric numbers for a river (or directed line) crossing two perpendicular roads at n points, beginning in the (-,-) quadrant, crossing x axis first and ending in any quadrant.at n=11A077551
- a(n) = prime(n) + prime(n^2).at n=39A092504
- A tree-node counting triangle.at n=58A109244
- a(n) = -2*n + 7^n - 5^n.at n=5A121204
- a(n) = 441*n + 1.at n=30A158322
- Expansion of (2/(3*sqrt(1-4*z)-1+4*z))*((1-sqrt(1-4*z))/(2*z))^k with k=3.at n=7A172025
- Number of (n+1)X(n+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one.at n=1A206077
- Number of (n+1)X3 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one.at n=1A206079
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one.at n=4A206085
- Main diagonal of symmetric array defined by the recurrence T(n,1)=1, T(1,k)=1, for n >= k: T(n,k) = Sum_{i=1..k-1} T(n-i,k), for n < k: T(n,k) = Sum_{i=1..n-1} T(k-i,n).at n=9A212263
- Triangle T(n,k) in which n-th row lists in increasing order all positive integers with a representation as totally balanced 2n digit binary string without totally balanced proper prefixes such that all consecutive totally balanced substrings are in nondecreasing order; n>=1, 1<=k<=A000081(n).at n=39A216648
- a(n) = 31*n^2 + 1.at n=21A247155
- Numbers k such that 4*R_k + 7*10^k + 3 is prime, where R_k = 11...11 is the repunit (A002275) of length k.at n=6A259136
- Number of n X n 0..2 arrays with the sum of the absolute differences of each element with its horizontal and vertical neighbors equal to the number of neighbors.at n=4A265886
- T(n,k)=Number of nXk 0..2 arrays with the sum of the absolute differences of each element with its horizontal and vertical neighbors equal to the number of neighbors.at n=40A265887
- Irregular triangle read by rows: T(n,k) = number of size k subsets of S_n that remain unchanged under the operation of replacing a permutation with its inverse.at n=24A277081