15296
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 30480
- Proper Divisor Sum (Aliquot Sum)
- 15184
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7616
- Möbius Function
- 0
- Radical
- 478
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 2
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
- 58
- 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
- Coordination sequence for MgZn2, Position Zn2.at n=31A009938
- Numbers k not congruent to 0 (mod 3) such that phi(k) + 4 | sigma(k).at n=7A015806
- T(n,n-2), array T given by A047010.at n=8A047014
- a(n+1) = 4*(a(n)+a(n-1)) for n>1, a(1)=1, a(2)=6.at n=7A108051
- Expansion of (1+4*x-12*x^2-16*x^3)/((2*x+1)*(2*x-1)*(4*x^2+4*x-1)).at n=6A110046
- Triangle T, read by rows, equal to the matrix square of triangle A113095, which satisfies the recurrence: A113095(n,k) = [A113095^4](n-1,k-1) + [A113095^4](n-1,k).at n=11A113097
- Start with 1 and repeatedly reverse the digits and add 65 to get the next term.at n=29A118163
- Positive numbers of the form x^4 - 6 * x^2 * y^2 + y^4 (where x,y are integers).at n=34A135789
- Expansion of (1-x)/(1-2x+6x^2).at n=12A138229
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 0100-1111-0100 pattern in any orientation.at n=14A146379
- a(n) = ((4 + sqrt(18))*(4 + sqrt(8))^n + (4 - sqrt(18))*(4 - sqrt(8))^n)/8 .at n=5A164591
- Sequence A154690 adjusted to leading one:t(n,m)=A154690(n,m)-A154690(n,0)+1.at n=58A174669
- The left-hand half-triangle of A185356 (or A202690).at n=31A202816
- Row sums of triangle A178473.at n=8A203509
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 1.at n=39A259577
- Number of nX6 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2.at n=3A275502
- T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2.at n=39A275504
- Coefficients in the expansion of 1/([r] + [2r]x + [3r]x^2 + ...); [ ] = floor, r = 7/4.at n=22A279678
- Total number of (undirected) graph paths in simple graphs on n nodes.at n=5A288430
- p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - S - 2 S^2 + 2 S^3.at n=14A291250