15106
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 28224
- Proper Divisor Sum (Aliquot Sum)
- 13118
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5904
- Möbius Function
- 1
- Radical
- 15106
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 133
- 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
- Convolution of natural numbers >= 2 and Fibonacci numbers.at n=16A023548
- Number of distributive lattices; also number of paths with n turns when light is reflected from 7 glass plates.at n=6A025030
- Dot product of the squares and the quarter-squares: a(n) = sum(i=1..n, i^2 * floor(i^2/4)).at n=11A060453
- Total number of even parts in all partitions of n.at n=28A066898
- Partial sums of A084570.at n=23A084569
- G.f.: Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 5.at n=38A091773
- Absolute row sums of triangle A104967.at n=24A104968
- a(n) = (n+1)*(n+2)*(61*n^4 + 366*n^3 + 845*n^2 + 888*n + 360)/720.at n=6A108675
- a(n) = 4*a(n-1) - 6*a(n-2) + 6*a(n-3) - 3*a(n-4), with initial terms 0, 0, 0, 1.at n=14A137247
- Triangle T(n,k) read by rows: number of k X k symmetric matrices with nonnegative integer entries and without zero rows or columns such that sum of all entries is equal to n, n>=1, 1<=k<=n.at n=41A138177
- 13 times pentagonal numbers: a(n) = 13*n*(3*n-1)/2.at n=28A153793
- a(n) = 686*n + 14.at n=21A157366
- Number of n X 2 binary arrays with all 1s connected, a path of 1s from left column to lower right corner, and no 1 having more than two 1s adjacent.at n=16A163704
- Least common multiple of reversals of divisors of n in decimal representation.at n=37A188649
- A046802(x,y) --> A046802(x,y+1), transform of e.g.f. for the graded number of positroids of the totally nonnegative Grassmannians G+(k,n); enumerates faces of the stellahedra.at n=32A248727
- Smallest m, such that there are exactly n solutions of the equation (m+k)' = m' + k', where 1 <= k <= 2*m and x' = A003415(x), the arithmetic derivative of x.at n=12A258138
- a(n) = n*(n + 1)*(11*n^2 + 11*n - 10)/24.at n=13A264854
- Number of n X 4 nonnegative integer arrays with new values introduced in each row and column in sequential order starting with zero.at n=4A268075
- Number of nX5 nonnegative integer arrays with new values introduced in each row and column in sequential order starting with zero.at n=3A268076
- T(n,k)=Number of nXk nonnegative integer arrays with new values introduced in each row and column in sequential order starting with zero.at n=31A268079