15096
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
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 41040
- Proper Divisor Sum (Aliquot Sum)
- 25944
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 3774
- Omega Function (Ω)
- 6
- 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
- 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 Costas arrays of order n, counting rotations and flips as distinct.at n=17A008404
- Number of partitions of n into parts not of the form 15k, 15k+4 or 15k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=39A035958
- Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x).at n=23A097155
- Indices of primes in sequence defined by A(0) = 61, A(n) = 10*A(n-1) + 11 for n > 0.at n=12A101522
- a(n) = (5*n/18 + 19/54)*2^n - (-1)^(n-1)*(3*n + 4)/27.at n=11A127979
- Number of permutations of 1..n with all differences of elements separated by distances 1 through 8 being respectively unique.at n=17A170814
- Number of permutations of 1..n with all differences of elements separated by distances 1 through 9 being respectively unique.at n=17A170815
- Coefficients of a Hermite-like polynomial from Eulerian polynomials: p(x,n) = Sum_{k=1..n+1} [Eulerian(n + 1, k - 1)*x^(k - 1)]; q(x,n) = p''(x,n) - x*p'(x,n) + n*p(x,n).at n=16A171633
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 5.at n=35A209990
- Number of (w,x,y) with all terms in {0,...,n} and w<x+y and x<=y.at n=32A212982
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum not 1 3 6 or 8 and every diagonal and antidiagonal sum 1 3 6 or 8.at n=7A252046
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not 1 3 6 or 8 and every diagonal and antidiagonal sum 1 3 6 or 8.at n=28A252053
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not 1 3 6 or 8 and every diagonal and antidiagonal sum 1 3 6 or 8.at n=35A252053
- a(n) = n*(n+1)*(22*n-19)/6.at n=16A256716
- a(n) = 6*n*(9*n-5).at n=17A277984
- a(n) = Sum_{k=1..n} phi(gcd(k, n))^3.at n=34A342535
- Numbers such that the two numbers before and the two numbers after are squarefree semiprimes.at n=30A358666
- Number of edges in the hyperoctahedral (or cocktail party) graph of order n.at n=11A368757