13744
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
- 10
- Divisor Sum
- 26660
- Proper Divisor Sum (Aliquot Sum)
- 12916
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6864
- Möbius Function
- 0
- Radical
- 1718
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 151
- 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
- Coordination sequence for MgNi2, Position Mg2.at n=29A009935
- Second differences of Bell numbers.at n=7A011965
- Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1).at n=42A011971
- Sequence formed by reading rows of triangle defined in A011971.at n=34A011972
- [ sqrt(3/2)^n ].at n=47A014215
- Numbers k such that the continued fraction for sqrt(k) has period 92.at n=34A020431
- Number of terms in n-th derivative of a function composed with itself 3 times.at n=19A022811
- Numbers whose set of base-15 digits is {1,4}.at n=23A032827
- StirlingS2[ n,m ] triangle summed down the columns.at n=47A036560
- Number of distinct non-extendable sequences X={x(1),x(2),...,x(k)} where x(1)=1, the x(i)'s are distinct elements of {1,...,n} with |x(i)-x(i+1)|=1 or 2, for i=1,2,...,k.at n=15A054668
- Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have an increase at index k (1<=k<n).at n=29A056861
- a(n+1) = a(n)-th composite and a(1) = 13.at n=33A059408
- Football league numbers: the possible point series for a league of n teams playing each other twice where for each match 3 points are awarded to the winning team and 1 to each in the case of a tie.at n=4A064422
- Triangle read by rows: Aitken's array (A011971) but with a leading diagonal before it given by the Bell numbers (A000110), 1, 1, 2, 5, 15, 52, ...at n=52A095149
- Difference array of Bell numbers A000110 read by antidiagonals.at n=52A106436
- Triangle read by rows, based on a simple Fibonacci recursion rule.at n=58A111669
- Mirror image of the Bell triangle A011971, which is also called the Pierce triangle or Aitken's array.at n=38A123346
- Triangle read by rows, A000012 * A008277.at n=47A137649
- Minimal exponents m such that the fractional part of (101/100)^m obtains a minimum (when starting with m=1).at n=7A153669
- A000110 / (1,2,3,...): (convolved with (1,2,3,...) = Bell numbers).at n=8A154108