15366
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 33264
- Proper Divisor Sum (Aliquot Sum)
- 17898
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4704
- Möbius Function
- 1
- Radical
- 15366
- Omega Function (Ω)
- 4
- 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
- 40
- 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 Barlow packings with group P3m1 that repeat after n layers.at n=13A011953
- All differences C(j)-C(i), j>i, of Catalan numbers A000108.at n=38A047075
- 5-digit terms in the continued fraction for Pi.at n=12A048960
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=14A049958
- Triangle T(n,k) (1 <= k <= n) read by rows: T(n,k) is the number of permutations of [1..n] with k components.at n=38A059438
- A diagonal of A059438.at n=6A059440
- Number of (unordered) ways of making change for n cents using coins of 1/2, 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage denominations up to 100 cents).at n=44A067997
- Triangle read by rows. T(n, k) = A059438(n, k) for 1 <= k <= n, and T(n, 0) = n^0.at n=48A085771
- A Binet like formula using the Akiyama-Thurston tile roots for a Minimal Pisot theta0 sequence.at n=35A097600
- Number of nX2 0..2 arrays with every diagonal, row and column running average nondecreasing rightwards and downwards and diagonally.at n=9A201149
- Array read by antidiagonals: T(m,n) = Sum(1<=i<=m) i * ( n + 2(i-1) )!at n=12A211366
- Triangle read by rows: T(n,k) = number of k-classes of permutations of n letters avoiding the pattern 132 (n>=1, 0 <= k <= n-1).at n=52A261665
- Triangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n elements with n-k elements in its connectivity set.at n=42A263484
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 405", based on the 5-celled von Neumann neighborhood.at n=27A271814
- Product of n-th prime and the sum of the divisors of n.at n=44A272211
- Numbers n such that Bernoulli number B_{n} has denominator 3318.at n=12A272383
- Number of certain noncrossing set partitions.at n=8A280891
- Triangle read by rows, T(n, k) = [x^k] ((2*x^3 - 3*x^2 - x + 1)/(1 - x)^(n + 2)), for n >= 1 and 0 <= k < n.at n=53A350584
- Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a Catalan number (A000108).at n=24A353983
- a(1) = 2; for n > 1, a(n) = a(n-1)*prime(n) if a(n-1) <= prime(n), otherwise a(n) = a(n-1) mod prime(n).at n=44A387775