6021
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8960
- Proper Divisor Sum (Aliquot Sum)
- 2939
- 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
- 3996
- Möbius Function
- 0
- Radical
- 669
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 41
- 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) = 10000*log_10(n) rounded to the nearest integer.at n=3A004229
- a(n) = 10000*log_10(n) rounded up.at n=3A004230
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (odd natural numbers).at n=19A025106
- Molien series for complete weight enumerator of self-dual code over GF(5).at n=31A028344
- a(n)=(s(n)+4)/10, where s(n)=n-th base 10 palindrome that starts with 6.at n=24A043085
- a(1) = 4; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=43A046254
- Numbers k such that k^2 is composed of three 1-digit-overlapping subsquares.at n=6A048426
- Number of n-node simple graphs having clique number 3.at n=7A052451
- Largest member of the n-th row of the triangular triangle (A093445).at n=30A093446
- Row 7 of the array in A107735.at n=6A107731
- Array read by antidiagonals: A(n,k) = Verlinde numbers for quasiparabolic bundles (n >= 3, k >= 0).at n=61A107735
- Triangle read by rows formed from nonzero entries in table of number of graphs on n nodes with clique number k.at n=26A115196
- Let T(S,Q) be the sequence obtaining by starting with S and repeatedly reversing the digits and adding Q to get the next term. This is T(1016,5), the first S for which T(S,5) reaches a cycle of length 36.at n=38A118879
- Let T(S,Q) be the sequence obtaining by starting with S and repeatedly reversing the digits and adding Q to get the next term. This is T(1016,5), the first S for which T(S,5) reaches a cycle of length 36.at n=2A118879
- Number of Ferrers diagrams with a single Ferrers puncture with the same orientation inscribed strictly inside with half-perimeter = n.at n=6A133106
- a(n) = n*(8*n+7).at n=27A139278
- 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, -1), (-1, 0, 1), (-1, 1, 0), (1, 0, 0)}.at n=10A148498
- Transform of the finite sequence (1, 0, -1, 0, 1) by the T_{0,1} transformation (see link).at n=10A159341
- a(n) is the n-th J_18-prime (Josephus_18 prime).at n=4A163798
- a(n) = (7*n^2 + 7*n - 12)/2.at n=40A166146