13322
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19986
- Proper Divisor Sum (Aliquot Sum)
- 6664
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6660
- Möbius Function
- 1
- Radical
- 13322
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 33.at n=38A020372
- k th digit of a(n) = number of different digits within 2 places of k (not including k).at n=12A039987
- Number of binary arrangements without adjacent 1's on n X n rhombic hexagonal grid.at n=5A066864
- Expansion of o.g.f. (1-x^2+x^4)/((1-x)^2*(1-x^2)^4*(1-x^3)^4).at n=17A123991
- The sequence c[n] defined in A126940.at n=9A126947
- a(n) is the smallest number which has in its English name the letter "o" in the n-th position, or -1 if no such number exists.at n=36A164789
- Number of simple unlabeled graphs on n nodes with exactly 5 connected components that are trees or cycles.at n=13A215985
- Unmatched value maps: number of nX5 binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..1 nX5 array.at n=4A219738
- T(n,k) = Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..1 nXk array.at n=40A219741
- Number of partitions of n having 1 more even part than odd, so that there is an ordering of parts for which the even and odd parts alternate and the first and last terms are even.at n=51A239832
- Number of partitions p of n such that (number of distinct parts of p) >= max(p) - min(p).at n=50A239958
- Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 1.at n=49A240010
- a(n) = 10*n^2 + 10*n + 2.at n=36A273366
- Let s(n,j) be Sum_{i=1..j} (prime(primepi(n) + i) mod n). Numbers n such that there exists j with s(n,j) = n.at n=34A274423
- Number of nX3 0..1 arrays with each 1 adjacent to 1, 2 or 4 king-move neighboring 1s.at n=5A296734
- Number of nX6 0..1 arrays with each 1 adjacent to 1, 2 or 4 king-move neighboring 1s.at n=2A296737
- T(n,k) = Number of n X k 0..1 arrays with each 1 adjacent to 1, 2 or 4 king-move neighboring 1's.at n=30A296739
- T(n,k) = Number of n X k 0..1 arrays with each 1 adjacent to 1, 2 or 4 king-move neighboring 1's.at n=33A296739
- Triangle read by rows: T(n,k) is the number of non-intersecting loops starting at (0,0) on the n X k torus consisting of steps up and to the right, 1 <= k <= n.at n=38A324604
- Numbers of graphs which are double triangle descendants of K_5 with four more vertices than triangles.at n=29A332735