13404
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 31304
- Proper Divisor Sum (Aliquot Sum)
- 17900
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4464
- Möbius Function
- 0
- Radical
- 6702
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 138
- 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
- a(n) = a(n-2) + a(n-5).at n=51A001687
- Number of binary words of length n in which the ones occur only in blocks of length at least 4.at n=24A005253
- Expansion of 2*x^2*(1-x)/(1-3*x+2*x^2-2*x^3).at n=12A115219
- Trajectory of 13 under map n -> A132948(n).at n=29A132946
- A symmetrical triangle sequence made from A154537:q(x,n)= Sum[(2*m + 1)^n*x^m/m!, {m, 0, Infinity}]/(Exp[x]); p(x,n)=q(x,n)+x^n*q(1/x,n); t(n,m)=coefficients(p(x,n)).at n=23A154923
- A symmetrical triangle sequence made from A154537:q(x,n)= Sum[(2*m + 1)^n*x^m/m!, {m, 0, Infinity}]/(Exp[x]); p(x,n)=q(x,n)+x^n*q(1/x,n); t(n,m)=coefficients(p(x,n)).at n=25A154923
- Numbers k such that 6^k + k^6 - 1 is prime.at n=3A216425
- Expansion of 1/(1 - x - x^2 + x^7 - x^9).at n=21A225394
- Partitions with subdiagonal growth: number of partitions (p0, p1, p2, ...) of n with pi - p0 <= i.at n=38A238876
- Number of partitions of n such that the successive differences of consecutive parts are nondecreasing.at n=61A240026
- Sequence defined by a(1)=a(2)=1 and a(n) = gray(a(n-1) + a(n-2)), with gray(m) = A003188(m).at n=14A265385
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 422", based on the 5-celled von Neumann neighborhood.at n=41A272087
- Number of compositions (ordered partitions) of n into prime divisors of n.at n=50A284463
- Positive numbers k such that k and k + 1 are both positive negaFibonacci-Niven numbers (A331085) and -k and -(k + 1) are both negative negaFibonacci-Niven numbers (A331088).at n=28A331092
- Number of compositions of 5*n into parts 2 and 5.at n=10A369840
- Expansion of (1 + x)/(1 - x^2*(1 + x)^3).at n=16A375315