15010
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 28800
- Proper Divisor Sum (Aliquot Sum)
- 13790
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5616
- Möbius Function
- 1
- Radical
- 15010
- 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
- 177
- 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 partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 4).at n=46A035548
- Triangles in open triangular matchstick arrangement (triangle minus one side) of side n.at n=39A045947
- Numbers k such that k*2^k - k - 1 is prime.at n=21A046843
- Partial sums of second pentagonal numbers with even index (A049453).at n=19A051895
- Composite numbers k such that sigma(k)*(phi(k) + 2) is a square.at n=26A065655
- Number of monic polynomials with integer coefficients of degree n with all roots on the unit circle; number of products of cyclotomic polynomials of degree n.at n=18A120963
- Triangle T(n,k) by rows: T(n, k) = (3*n-3*k+1)*T(n-1, k-1) +(3*k-2)*T(n-1, k) + 3*T(n-2, k-1) with T(n, 1) = T(n, n) = 1.at n=29A144440
- Triangle T(n,k) by rows: T(n, k) = (3*n-3*k+1)*T(n-1, k-1) +(3*k-2)*T(n-1, k) + 3*T(n-2, k-1) with T(n, 1) = T(n, n) = 1.at n=34A144440
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 3, read by rows.at n=29A157209
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 3, read by rows.at n=34A157209
- 15-gonal (or pentadecagonal) pyramidal numbers: a(n) = n*(n+1)*(13*n-10)/6.at n=19A177890
- A transform of the central binomial coefficients.at n=11A186335
- Number of arrays of n+2 integers in -5..5 with sum zero and the sum of every adjacent pair being odd.at n=4A202073
- T(n,k)=Number of arrays of n+2 integers in -k..k with sum zero and the sum of every adjacent pair being odd.at n=40A202076
- Number of arrays of 7 integers in -n..n with sum zero and the sum of every adjacent pair being odd.at n=4A202078
- Number of compositions of n such that the first part is 1 and the second differences of the parts are in {-9,...,9}.at n=16A239559
- Number of multiset partitions of integer partitions of n with constant block sizes and constant block sums.at n=35A358835
- Expansion of 1/sqrt((1 - x^2 - x^5)^2 - 4*x^7).at n=29A376783