13178
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21600
- Proper Divisor Sum (Aliquot Sum)
- 8422
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5980
- Möbius Function
- -1
- Radical
- 13178
- 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
- Oscillates under partition transform.at n=49A007211
- Number of series-reduced dyslexic planted planar trees with n leaves of 2 colors.at n=6A032133
- Least numbers m such that GCD of two consecutive values of cototients, i.e., gcd(cototient(m+1), cototient(m)) equals 2n - 1.at n=30A070017
- Number of partitions of n into {number of partitions of n into "number of partitions of n into 'number of partitions of n into partition numbers' numbers" numbers} numbers.at n=49A130900
- Weak Goodstein sequence starting at 11.at n=41A137411
- a(n) = n^4 - n^3 - n^2 - n.at n=11A152016
- Number of (n+2) X 9 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=13A190031
- Number of partitions p of n such that (sum of parts with multiplicity 1) < (sum of all other parts).at n=38A240448
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 193", based on the 5-celled von Neumann neighborhood.at n=27A270687
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 449", based on the 5-celled von Neumann neighborhood.at n=27A272254
- Number of aperiodic necklaces (Lyndon words) with k<=8 black beads and n-k white beads.at n=20A277633
- Numbers k at which point A336459(k) appears multiplicative, but A051027(k) does not.at n=21A336561
- The number of stable vertically balanced self-avoiding walks of length n on the upper half-plane of a 2D square lattice where the nodes and connecting rods have equal mass.at n=10A337317
- a(n) is the least integer k such that n/(Sum_{j=1..n} 1/phi(k*j)) is an integer.at n=22A341813