13384
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 28800
- Proper Divisor Sum (Aliquot Sum)
- 15416
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5712
- Möbius Function
- 0
- Radical
- 3346
- Omega Function (Ω)
- 5
- 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
- 94
- 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
- Number of polyhedral graphs with n edges.at n=13A002840
- Numbers that are the sum of 9 nonzero 8th powers.at n=20A003387
- Coordination sequence for MgZn2, Mg position.at n=29A009939
- Smallest m such that A064672(m) = n.at n=24A064689
- Number of n-indecomposable polyominoes.at n=4A125759
- Number of ways to place 6 nonattacking knights on an n X n board.at n=4A178499
- E.g.f.: -log( Sum_{n>=0} (-x)^(n*(n+1)/2) / (n*(n+1)/2)! ).at n=7A205803
- Vinogradov's constants arising in enumeration of solutions to Waring's problem in the evil numbers (A001969).at n=25A206375
- a(0)=1, a(n) = least k > a(n-1) such that k*a(n-1) is a triangular number.at n=23A213005
- G.f.: A(x) = exp( Sum_{n>=1} A((-1)^n*x)^n * x^n/n ).at n=18A229116
- Number of compositions of n such that the smallest part has multiplicity seven.at n=11A241867
- Number T(n,k) of ways to place k nonattacking knights on an n X n board; triangle T(n,k), n>=0, 0<=k<=A030978(n), read by rows.at n=29A244081
- Number of (n+2)X(6+2) 0..3 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=16A253023
- Number of nX5 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2.at n=5A275501
- Number of 6 X n 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2.at n=4A275506
- Partial sums of A299896.at n=30A299897
- Number of triangles larger than size=1 in a matchstick-made hexagon with side length n.at n=16A307253
- Sum of the odd parts in the partitions of n into 5 parts.at n=36A309545
- Expansion of e.g.f. Product_{k>=1} ((1 + x^k)/(1 - x^k))^(phi(k)/k), where phi is the Euler totient function A000010.at n=6A318976
- Partial sums of A323183.at n=39A323187