11064
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27720
- Proper Divisor Sum (Aliquot Sum)
- 16656
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3680
- Möbius Function
- 0
- Radical
- 2766
- 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
- 99
- 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
- Numbers that are the sum of 7 positive 7th powers.at n=31A003374
- a(n) = n * prime(prime(n)).at n=23A080697
- Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges and k leaves at level 1.at n=37A101371
- Riordan array (1/((1-x)(1-3x)),x/((1-x)(1-3x))).at n=30A116414
- Number of ordered pairs of permutations generating a transitive group.at n=4A122949
- Triangle read by rows, iterates of matrix X * [1,0,0,0,...], where X = an infinite lower bidiagonal matrix with [1,3,1,3,1,3,...] in the main diagonal and [1,1,1,...] in the subdiagonal.at n=60A140070
- Triangle T(n,k) = A000142(n-k)*A003319(k+1) read by rows.at n=50A141476
- Numbers k such that k^3 - b2 is a triangular number (A000217), where b2 is the largest square less than k^3.at n=27A233401
- Number of (n+1) X (1+1) 0..2 arrays colored with the sets of distinct values in every 2 X 2 subblock.at n=3A236148
- Number of (n+1)X(4+1) 0..2 arrays colored with the sets of distinct values in every 2X2 subblock.at n=0A236151
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the sets of distinct values in every 2X2 subblock.at n=6A236155
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the sets of distinct values in every 2X2 subblock.at n=9A236155
- a(n) = 8*n^2 + 3*n + 1.at n=37A236267
- A sequence giving the solution to the problem of identifying two complementary defectives.at n=21A239915
- Terms k of A249667 such that k-A151799(k) = A151800(k)-k.at n=48A249676
- Expansion of b(2)*b(4)/(1 - 2*x - 2*x^3 + 3*x^4), where b(k) = (1-x^k)/(1-x).at n=11A266367
- Sum of the squares of the larger parts of the partitions of 2n into two squarefree parts.at n=24A280322
- Expansion of Product_{k>=1} ((1 - x^k)/(1 + x^k))^(sigma(k)).at n=22A320971
- Number of integer partitions of n with one fewer distinct multiplicities than distinct parts.at n=41A325244
- Triangular array read by rows: T(n,k) is the number of ordered pairs of n-permutations that generate a group with exactly k orbits, 0 <= k <= n, n >= 0.at n=16A327547