15288
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
- 2
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 47880
- Proper Divisor Sum (Aliquot Sum)
- 32592
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 0
- Radical
- 546
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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 ways of partitioning n points on a circle into subsets only of sizes 2 and 3.at n=15A001005
- Number of free subsets of multiplicative group of GF(2^n).at n=14A007230
- Numbers k such that k | sigma_7(k) - phi(k)^7.at n=16A055701
- a(n) = (9*n + 11)*binomial(n+10, 10)/11.at n=5A056128
- Triangle read by rows, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x)^2 + xy*f(x,y)^2.at n=41A086614
- Numbers that can be expressed as the difference of the squares of primes in exactly five distinct ways.at n=16A092001
- Sixth column (m=5) of (1,6)-Pascal triangle A096956.at n=12A096959
- In the interior of a regular 2n-gon with all diagonals drawn, the number of points where exactly three diagonals intersect.at n=26A101363
- a(n) = 4 * floor(28*2^n/15).at n=11A102650
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(1,1), d=(1,-2) and have k peaks (i.e., ud's).at n=33A108767
- <h[d+1,d-1],s[d,d]*s[d,d]*s[d,d]> where h[d+1,d-1] is a homogeneous symmetric function, s[d,d] is a Schur function indexed by two parts, * represents the Kronecker product and <, > is the standard scalar product on symmetric functions.at n=33A115376
- Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0).at n=30A120986
- Expansion of (f(q) * f(q^3) / (f(-q) * f(-q^3)))^2 in powers of q where f() is a Ramanujan theta function.at n=15A123861
- Define an array by d(m, 0) = 1, d(m, 1) = m; d(m, k) = (m - k + 1) d(m+1, k-1) - (k-1) (m+1) d(m+2, k-2). Sequence gives d(n,3).at n=26A126935
- Triangle read by rows: (1/4) * (A007318^3 - A007318^(-1)) as infinite lower triangular matrices.at n=39A131049
- Numerator coefficients for generators of lattice path enumeration square array A111910.at n=26A140136
- Numerator coefficients for generators of lattice path enumeration square array A111910.at n=25A140136
- A090801(2n-1)+A090801(2n).at n=34A140958
- Number of n X n binary arrays, symmetric under horizontal reflection, with every 1 adjacent to at least one other 1 both bishopwise and rookwise but with no three 1s in a row bishopwise or rookwise.at n=8A144237
- Sequence of the "Natural Jewels": a natural jewel is a number that is totally enclosed by prime numbers in a version of Ulam Spiral.at n=11A172294