13133
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
- 13728
- Proper Divisor Sum (Aliquot Sum)
- 595
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12540
- Möbius Function
- 1
- Radical
- 13133
- 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
- 76
- 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
- Numbers having only digits 1 and 3 in their decimal representation.at n=41A032917
- Triangle of numbers arising in recursive computation of A002212.at n=38A073149
- a(n) = (A085249(n) - 1)/6.at n=20A088349
- Column 2 of triangle A091602.at n=45A091605
- Number of ways to place n+2 queens and 2 pawns on an n X n board so that no two queens attack each other (symmetric solutions count only once).at n=11A129552
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 0, 0), (1, -1, 0), (1, 1, 1)}.at n=8A149545
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=8A149546
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows.at n=11A153656
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows.at n=13A153656
- (1, 3, 5, 7, 9, ...) convolved with (1, 0, 3, 5, 7, 9, ...).at n=27A179903
- Indices of record high-points in the sequence of Sprague-Grundy values for Grundy's game.at n=42A180120
- Number of distinct solutions of Sum_{i=1..2} (x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1.at n=41A180773
- List of primitive words over the alphabet {1,3}.at n=32A213970
- The generalized Fibonacci words q_n^[4].at n=2A221155
- Numerators of increasingly better rational approximations to log(3)/log(2) with increasing denominators.at n=14A254351
- Least k > 1 such that phi(k*n-1) = phi(k*n+1), or -1 if no such k exists.at n=21A276052
- Least k such that phi(k*n-1) = phi(k*n+1), or -1 if no such k exists.at n=21A276373
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 534", based on the 5-celled von Neumann neighborhood.at n=13A282960
- Chebyshev pseudoprimes to base 2: composite numbers k such that T(k, 2) == 2 (mod k), where T(k, x) is the k-th Chebyshev polynomial of the first kind.at n=40A330206
- Odd composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 4 (mod m), where U(m)=A001353(m) and V(m)=A003500(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=4 and b=1, respectively.at n=32A337778