13668
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 34272
- Proper Divisor Sum (Aliquot Sum)
- 20604
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 0
- Radical
- 6834
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 58
- 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) = floor( n*(n-1)*(n-2)/22 ).at n=68A011904
- Numbers k such that k | sigma_11(k).at n=29A055715
- Numbers m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,39.at n=3A064256
- Maximum value taken on by f(P) = Sum_{i=1..n} p(i)*p(n+1-i) as {p(1),p(2),...,p(n)} ranges over all permutations P of {1,2,3,...,n}.at n=34A087035
- Number of planar partitions that are not corners.at n=16A115982
- 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, -1), (-1, -1, 0), (-1, 0, 0), (0, 0, 1), (1, 1, 0)}.at n=8A150122
- Six times hexagonal numbers: 6*n*(2*n-1).at n=34A152746
- Number of ways to place 2 nonattacking knights on an n X n board.at n=12A172132
- Number of 2 X 2 matrices having all terms in {-n,...,0,..,n} and permanent=trace.at n=37A211145
- Number of composites removed in each step of the Sieve of Eratosthenes for 10^7.at n=23A227155
- Number of length n+3 0..7 arrays with some disjoint pairs in every consecutive four terms having the same sum.at n=4A247532
- Number of length 5+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum.at n=6A247537
- Edge count of the n X n white bishop graph.at n=34A289179
- Numbers equal to the sum of three oblong numbers in arithmetic progression.at n=33A292314
- Number of parts in all partitions of n with largest multiplicity ten.at n=28A320380
- Position of the first occurrence of an element in the continued fraction of zeta(n) which is larger than the second element.at n=12A343244
- Positions of -2's in A346242.at n=47A354822
- Expansion of Sum_{k>0} x^(4*k)/(1-x^k)^4.at n=44A363611
- E.g.f. satisfies A(x) = (1 - x * log(1 - x) * A(x))^2.at n=6A377438