6039
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 9672
- Proper Divisor Sum (Aliquot Sum)
- 3633
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3600
- Möbius Function
- 0
- Radical
- 2013
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(25*n - 1)/2.at n=22A022282
- "DFK" (bracelet, size, unlabeled) transform of 1,2,3,4...at n=16A032216
- Divisors = 3 (mod 4) of Descartes's 198585576189.at n=43A033871
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=45A036810
- Numbers k such that 61*2^k-1 is prime.at n=25A050556
- Numbers n such that 229*2^n-1 is prime.at n=28A050866
- Partial sums of A051740.at n=8A051877
- Integer part of (Product(n^((1 + log(1 + i))/(1 + i^2)), {i, 1, n})).at n=43A062492
- Nearest integer to (Product(n^((1 + log(1 + i))/(1 + i^2)), {i, 1, n})).at n=43A062493
- Products of Wythoff pairs: [n*r]*[n*r^2], where [] is the floor function and r is the golden ratio, (1+sqrt(5))/2.at n=37A075312
- Expansion of g.f. (x^2+x+1)*(2*x^2+2*x+1)*(x-1)^2/((1-x^2-2*x^3)*(x^4+1)).at n=24A107850
- Numbers n such that the sum of the digits of phi(n)^n is divisible by n.at n=8A109661
- G.f.: 1/(1 - 7 x + 15 x^2 - 6 x^3 - 11 x^4 + 6 x^5 + x^6).at n=6A122611
- Members of A054591 that are not members of A121153.at n=35A135666
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (0, 0, -1), (0, 1, 0), (1, 0, 1)}.at n=7A150259
- Number of planar n X n X n binary triangular grids with mirror symmetry about one altitude with no more than 3 ones in any 3 X 3 X 3 subtriangle.at n=7A153921
- The Riordan square of the little Schröder numbers A001003.at n=30A172094
- Number of two-sided n-step prudent walks ending on the top side of their box, avoiding two or more consecutive west steps and south steps.at n=10A190586
- G.f.: (1+x)^(2*g)*(1+x^3)^(3*g)/((1-x^2)*(1-x^4))-x^(2*g)*(1+x)^4/((1-x^2)*(1-x^4)) for g=2.at n=56A199628
- a(n) is the smallest integer that is the sum of n distinct terms of A075058.at n=12A202618