15184
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
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 32116
- Proper Divisor Sum (Aliquot Sum)
- 16932
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6912
- Möbius Function
- 0
- Radical
- 1898
- Omega Function (Ω)
- 6
- 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
- 40
- 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
- The Franel number a(n) = Sum_{k = 0..n} binomial(n,k)^3.at n=6A000172
- a(n) is the smallest number k such that A073813(k) = prime(n).at n=31A073814
- Spiro-tribonacci numbers: a(n) = sum of three previous terms that are nearest when terms arranged in a spiral.at n=33A092360
- Array read by antidiagonals: Solutions to Schmidt's Problem.at n=34A094424
- Inverse Moebius transform of the shifted tetrahedral numbers.at n=42A116963
- a(n) is such that the a(n)-th composite number is (n-th prime)^2.at n=31A120389
- Number of unlabeled maximal independent sets in the n-cycle graph.at n=47A127687
- 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, 0), (-1, -1, 1), (-1, 1, -1), (0, 1, 0), (1, 0, 0)}.at n=9A149840
- a(n) = floor(3^n/(3n-1)).at n=11A191627
- Number of n X 4 nonnegative integer arrays each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it).at n=4A202545
- Number of nX5 nonnegative integer arrays each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it).at n=3A202546
- T(n,k) = Number of n X k nonnegative integer arrays with each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it).at n=31A202549
- T(n,k) = Number of n X k nonnegative integer arrays with each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it).at n=32A202549
- Number of 3Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=8A207112
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209170; see the Formula section.at n=47A209171
- a(n) = 2*( a(n-5) + a(n-8) + a(n-11) ) for n >= 12.at n=41A226592
- Number of partitions p of n such that (number of numbers of the form 5k + 2 in p) is a part of p.at n=37A241551
- Multiply a(n-1) by 2 and drop all 0's.at n=30A242350
- Number of (5+1)X(n+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically.at n=11A253702
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 502", based on the 5-celled von Neumann neighborhood.at n=31A272579