11796
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
- 12
- Divisor Sum
- 27552
- Proper Divisor Sum (Aliquot Sum)
- 15756
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3928
- Möbius Function
- 0
- Radical
- 5898
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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 ways of numbering the faces of a cube with nonnegative integers so that the sum of the 6 numbers is n.at n=29A054473
- a(n) = (1/3!)*(n^3 + 24*n^2 + 107*n + 90), compare A059604.at n=34A059605
- Number of partitions of n into parts but with two kinds of parts of sizes 1 to 9.at n=18A103928
- Numbers n such that primorial(n)/2 - 1024 is prime.at n=17A139456
- Numbers k>1 such that phi(phi(k)) = sigma(sopf(k)).at n=41A173337
- Number of 6-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=9A187159
- Number of length-n 0..3 arrays with no repeated value equal to the previous repeated value.at n=6A269462
- T(n,k)=Number of length-n 0..k arrays with no repeated value equal to the previous repeated value.at n=42A269467
- Number of length-7 0..n arrays with no repeated value equal to the previous repeated value.at n=2A269471
- When A002487 is written as a triangle the n-th row has length 2^(n-1); a(n) is the maximal multiplicity of any entry in that row, considering the entries strictly between the initial 1 and the central 2.at n=35A293957
- Numbers k such that 7^k + k^7 is prime.at n=2A309422
- Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes using only a compass.at n=32A361623
- Expansion of g.f. A(x) satisfying A(x)^2 = Sum_{n=-oo..+oo} (-x)^n * (A(x)^3 + x^(n-1))^(n+1).at n=5A363135