15116
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 26460
- Proper Divisor Sum (Aliquot Sum)
- 11344
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7556
- Möbius Function
- 0
- Radical
- 7558
- Omega Function (Ω)
- 3
- 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
- 84
- 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
- a(n) = Sum_{k>=1} floor(tau^(n-k)) where tau is A001622.at n=18A020956
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=16A049892
- Number of 4-element intersecting families (with not necessarily distinct sets) whose union is an n-element set.at n=4A052390
- Row sums of array A097306.at n=39A097307
- Expansion of 1/(1-4*x+x^3).at n=7A099503
- Sum of the first 3^n primes.at n=4A099826
- Sum of the first 2n+1 primes.at n=40A109723
- Sum of the first n^2 primes.at n=9A109724
- Positions in A181391 where the terms listed in A171863 appear.at n=21A171864
- Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 4 5 or 7 and every diagonal and antidiagonal sum 2 4 5 or 7.at n=3A251870
- Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 4 5 or 7 and every diagonal and antidiagonal sum 2 4 5 or 7.at n=1A251872
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 4 5 or 7 and every diagonal and antidiagonal sum 2 4 5 or 7.at n=11A251876
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 4 5 or 7 and every diagonal and antidiagonal sum 2 4 5 or 7.at n=13A251876
- Number of ways to place m nonattacking queens on an m X n board, 1 <= m <= n (triangular array).at n=64A269133
- Number of nXnXn triangular 0..4 arrays with some element less than a w, nw or ne neighbor exactly once.at n=3A271030
- T(n,k)=Number of nXnXn triangular 0..k arrays with some element less than a w, nw or ne neighbor exactly once.at n=24A271034
- Number of 4 X 4 X 4 triangular 0..n arrays with some element less than a w, nw or ne neighbor exactly once.at n=3A271036
- The profiles of the backtrack tree for the n queens problem, triangle read by rows.at n=76A319284