13654
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 20484
- Proper Divisor Sum (Aliquot Sum)
- 6830
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6826
- Möbius Function
- 1
- Radical
- 13654
- Omega Function (Ω)
- 2
- 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
- 182
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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 alternating sign 2n+1 X 2n+1 matrices invariant under all symmetries of the square.at n=9A005164
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 98 ones.at n=2A031866
- Trajectory of 1 under map n->9n+1 if n odd, n->n/2 if n even.at n=24A033962
- Number of partitions satisfying (cn(0,5) <= cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=52A036813
- Trajectory of 3 under map n->9n+1 if n odd, n->n/2 if n even.at n=34A037102
- Inverse binomial transform of a math magic problem.at n=14A084214
- a(1)=2, a(2)=4, a(3)=6; a(n+3) = a(n+2)+ 2*a(n), n>=1.at n=13A151794
- Triangle T(n, k) = binomial(2*n, n) + binomial(n, k)^2, read by rows.at n=38A157531
- Triangle T(n, k) = binomial(2*n, n) + binomial(n, k)^2, read by rows.at n=42A157531
- Number of n X n 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.at n=4A164753
- Number of nX6 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.at n=4A164758
- a(n) = (10*2^n + 2*(-1)^n)/3 for n > 0; a(0) = 1.at n=12A168648
- a(n) = (10*2^n + 3 - (-1)^n)/6.at n=13A171231
- a(n) is the number of initial persons such that the n-th person survives in the duck-duck-goose game.at n=11A182459
- Dispersion of A016825 (4k+2, k>0), by antidiagonals.at n=38A191668
- Number of (n+1)X2 0..3 matrices with each 2X2 permanent equal.at n=3A224968
- Number of (n+1)X5 0..3 matrices with each 2X2 permanent equal.at n=0A224971
- T(n,k) is the number of (n+1) X (k+1) 0..3 matrices with each 2 X 2 permanent equal.at n=6A224975
- T(n,k) is the number of (n+1) X (k+1) 0..3 matrices with each 2 X 2 permanent equal.at n=9A224975
- Number of (n+2)X(2+2) 0..1 arrays with no 3x3 subblock diagonal sum 2 and no antidiagonal sum 2 and no row sum 0 and no column sum 0.at n=7A255786