13354
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21888
- Proper Divisor Sum (Aliquot Sum)
- 8534
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6060
- Möbius Function
- -1
- Radical
- 13354
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 138
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of combinatorial types of simplicial n-dimensional polytopes with n+3 nodes.at n=15A000943
- Numbers k such that the continued fraction for sqrt(k) has period 96.at n=37A020435
- Pisot sequence T(7,10), a(n) = floor(a(n-1)^2/a(n-2)).at n=37A020752
- The n-th highly composite number equals the a(n)-th composite number, for n >= 3.at n=21A074329
- Number of odd composites between 2^n and 2^(n + 1).at n=15A094812
- If n==0 (mod 3) then a(n)=a(n-1); if n==1 (mod 3) then a(n)=a(n-2)+a(n-3); if n==2 (mod 3) then a(n)=a(n-3)+a(n-4)+a(n-5).at n=34A104204
- a(n) = a(n-1) + (n-2)*a(n-2) + a(n-3) starting a(0)=0, a(1)=a(2)=1.at n=11A121956
- Number of 8's in the last section of the set of partitions of n.at n=50A206558
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209575; see the Formula section.at n=52A209576
- Expansion of Sum_{k>=0} x^((k+1)^2)/(1-x)^k.at n=54A236310
- Partitions with superdiagonal growth: number of partitions (p0, p1, p2, ...) of n with pi - p0 >= i.at n=52A238860
- Numbers n such that 1+16n^2, 1+16(n+1)^2 and 1+16(n+2)^2 are prime.at n=42A255635
- Number of ways to choose a set partition of a strict integer partition of n.at n=30A294617
- G.f. A(x) satisfies: Sum_{n>=0} A(x)^(n*(n+1)+1) * x^n = Sum_{n>=0} (A(x)^(n+1) + 1)^n * x^n.at n=7A326561
- Number of semi-sums of strict integer partitions of n.at n=42A366741