6032
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 13020
- Proper Divisor Sum (Aliquot Sum)
- 6988
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2688
- Möbius Function
- 0
- Radical
- 754
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 67
- 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(1) = 1, a(2) = 0; for n > 2, a(n) = n*Fibonacci(n-2) (with the convention Fibonacci(0)=0, Fibonacci(1)=1).at n=15A006490
- Coordination sequence T3 for Zeolite Code MTN.at n=46A008188
- a(n) = n*(9*n-2).at n=26A013656
- Fibonacci sequence beginning 0, 16.at n=14A022350
- Number of ways to place a non-attacking white and black knight on n X n chessboard.at n=8A035289
- Number of partitions satisfying cn(1,5) <= cn(2,5) + cn(3,5) and cn(4,5) <= cn(2,5) + cn(3,5).at n=33A039890
- a(n) = Sum_{m=1..n, k=1..m} T(m,k), array T as in A049834.at n=35A049836
- Integer part of (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=36A062482
- Nearest integer to (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=36A062483
- Numbers k such that prime(k+1)-(k+1)*tau(k+1) = prime(k-1)-(k-1)*tau(k-1) where tau(k) = A000005(k) is the number of divisors of k.at n=41A067335
- Numbers k such that A000984(k) mod k = 0 and A080383(k) != 7.at n=21A080392
- Numbers m that divide binomial(m*(m+1), m+1)/m^2.at n=41A082529
- Number of intersections between a sphere inscribed in a cube and the n X n X n cubes resulting from a cubic lattice subdivision of the enclosing cube.at n=34A085690
- G.f.: (1+x^8+x^9+x^10+x^18)/((1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)*(1-x^6)*(1-x^7)).at n=54A097851
- Positive integers m such that the largest prime-power divisor of m equals the sum of the other maximal prime-power divisors (> 1) of m.at n=43A112343
- Maximum number of regions defined by n zigzag-lines in the plane when a zigzag-line is defined as consisting of two parallel infinite half-lines joined by a straight line segment.at n=37A117625
- Expansion of Sum_{k>=0} x^(k^2+k)/((1-x)(1-x^2)...(1-x^(2k))).at n=49A122134
- Rectangular table, read by antidiagonals, such that the o.g.f. of row n, R_n(y), satisfies: R_n(y) = Sum_{k>=0} y^k * R_k(y)^n for n>=0, with R_0(y) = 1/(1-y).at n=61A124460
- Row 4 of rectangular table A124460.at n=6A124464
- Number of different values of i^2+j^2+k^2+l^2+m^2 for i,j,k,l,m in [0,n].at n=37A132432