13336
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25020
- Proper Divisor Sum (Aliquot Sum)
- 11684
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6664
- Möbius Function
- 0
- Radical
- 3334
- 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
- 32
- 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
- Fourth row of the Pascal-(1,4,1) array A081579.at n=9A081588
- Square roots of A068178.at n=5A091877
- a(n) = (15*n^2 + 5*n + 2)/2.at n=41A093500
- Smallest number whose eighth power has at least n digits.at n=33A130082
- a(n) is the smallest number m from A173977 for which A020639(2m-1) = prime(n).at n=33A173979
- Total number of possible standard knight moves on an n X 2n chessboard, if the knight is placed anywhere.at n=29A180319
- Number of free poly-[3^3.4^2]-tiles (polyhouses) (holes allowed) with n cells.at n=8A197156
- Number of (n+1) X (3+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=3A234916
- Number of (n+1) X (4+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A234917
- T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=17A234921
- T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=18A234921
- Number T(n,k) of equivalence classes of ways of placing k 3 X 3 tiles in an n X 9 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=3, 0<=k<=2*floor(n/3), read by rows.at n=48A238582
- Number T(n,k) of equivalence classes of ways of placing k 3 X 3 tiles in an n X 10 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=3, 0<=k<=3*floor(n/3), read by rows.at n=38A238592
- Number of compositions of n into parts with distinct multiplicities.at n=16A242882
- Products of any two not necessarily distinct terms of A237424.at n=43A254143
- Expansion of Product_{k>=1} (1/(1 - 2*x^k))^k.at n=10A261561
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 358", based on the 5-celled von Neumann neighborhood.at n=37A271412
- Coefficients in the expansion of ([s] + [2s]x + [3s]x^2 + ...)/([r] + [2r]x + [3r]x^2 + ...); [ ] = floor, r = sqrt(3), s = r/(1-r).at n=35A279630
- Number of permutations s_1,s_2,...,s_n of 1,2,...,n such that for all j=1,2,...,n, Sum_{i=1..j} s_i is not a prime.at n=9A291504
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + 2*b(n-1) - b(n-2) - 1, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=16A294425