11976
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30000
- Proper Divisor Sum (Aliquot Sum)
- 18024
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3984
- Möbius Function
- 0
- Radical
- 2994
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- 50
- 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 nonequivalent dissections of an n-gon into n-4 polygons by nonintersecting diagonals up to rotation.at n=7A003445
- Number of spanning trees with degrees 1 and 3 in S_4 X P_{2n-1}.at n=6A003756
- From a Fibonacci-like differential equation.at n=7A005444
- Sort then Add, a(1)=15.at n=16A033898
- Sort then Add, a(1)=21.at n=15A033901
- Sum of terms in n-th rows of triangle in A077159.at n=27A077162
- Row sums of A081964.at n=27A081966
- Let f(k, n) be the product of n consecutive numbers beginning with k. Then a(n) is the least k > 1+n*(n-1)/2 such that f(k, n) is a multiple of f(1+n*(n-1)/2, n).at n=14A093908
- a(n) = 997*n + 1009.at n=11A100776
- Number of distinct angles in all integer-sided triangles with all sides <= n.at n=41A123325
- Triangle, read by rows, where T(n,k) equals the dot product of the vector of terms in row n that are to the right of T(n,k) with the vector of terms in column k that are above T(n,k) for n>k+1>0, with the odd numbers in the secondary diagonal and all 1's in the main diagonal.at n=29A128320
- Column 1 of triangle A128320; a(n) = A128321(n) + 2n*A128321(n-1), where A128321 is column 0 of triangle A128320.at n=6A128322
- E.g.f. exp(sum_{d|M} (exp(d*x)-1)/d), M=15.at n=4A141011
- a(1)=4. a(n) = a(n-1) + n, if a(n-1)+n is composite. Otherwise a(n) = a(n-1)*n.at n=20A175459
- Numbers n such that 15*prime(n)+{-4,-2,2,4} are all primes.at n=29A176002
- Number of tilings of a 6 X 6 X n box using 6n bricks of shape 6 X 1 X 1.at n=8A233424
- Number of (n+1) X (1+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A235072
- Number of (n+1) X (3+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=0A235074
- T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=3A235078
- T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=5A235078