13343
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14568
- Proper Divisor Sum (Aliquot Sum)
- 1225
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12120
- Möbius Function
- 1
- Radical
- 13343
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- no
- Odd
- yes
Appears in sequences
- Molien series for A_9.at n=40A008632
- Numbers k such that k^2 contains exactly 9 different digits.at n=13A054037
- a(n) = A078398(n+1)/A078398(n).at n=2A078399
- Triangle read by rows: T(n,k) is the number of permutations of [n] with k runs of length 1. For example, 457/3/26/1 has two runs of length 1: 3 and 1.at n=38A097898
- Numbers n such that P(4n) is prime, where P(m) is the number of partitions of m.at n=37A111045
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-1111-0100 pattern in any orientation.at n=10A146707
- Smallest k such that 39^k mod k = n.at n=40A178200
- Number of nondecreasing arrangements of n numbers x(i) in -(n+3)..(n+3) with the sum of sign(x(i))*x(i)^2 zero.at n=7A187998
- Number of nondecreasing arrangements of 8 numbers x(i) in -(n+6)..(n+6) with the sum of sign(x(i))*x(i)^2 zero.at n=4A188008
- Number of nX7 0..4 arrays with each element equal to the number its horizontal and vertical neighbors equal to 2.at n=8A197060
- Second column of array in A235610.at n=7A235612
- a(1) = 2, a(2) = 3; thereafter a(n) = a(n-1) + a(|n-a(T)|), where a(T) is the largest term in the sequence before a(n) such that 0 < |n-a(T)| < n.at n=36A271063
- Number of distinct hook length sets of partitions of n.at n=43A301512
- a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/4)} binomial(n,4*k+1) * a(k).at n=15A352904
- Number of ways to write n as a nonnegative linear combination of a strict integer partition.at n=22A365002
- Numbers k that divide the k-th term of the tribonacci sequence A000213.at n=3A373055