6220
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 6884
- 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
- 2480
- Möbius Function
- 0
- Radical
- 3110
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 36
- 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 lines through exactly 8 points of an n X n grid of points.at n=57A018815
- Number of self-avoiding closed walks (from (0,0) to (0,0)) of length 2n in strip {-1, 0, 1} X Z.at n=10A022444
- Expansion of Product_{m >= 1} (1-m*q^m)^15.at n=9A022675
- a(n) = Sum_{i=0..2*n} Sum_{j=0..n-1} A026519(j, i).at n=9A026534
- Numbers whose set of base-8 digits is {1,4}.at n=39A032820
- Numbers that are repdigits in base 6.at n=24A048331
- Number of 11-core partitions of n.at n=48A053691
- Number of primitive (period n) periodic palindromic structures using exactly three different symbols.at n=17A056519
- Let u(1)=u(2)=1, u(3)=2n, u(k) = abs(u(k-1)-u(k-2)-u(k-3)) and M(k) = Max_{i<=i<=k} u(i), then for any k >= A078109(n), M(k) = floor(sqrt(k + a(n))).at n=14A078108
- Number of permutations of length n containing exactly one occurrence of the pattern 1-32.at n=6A086226
- Number of partitions of {1,...,n} into block sizes a power of 2.at n=9A115625
- Number of permutations of length n which avoid the patterns 1342, 3214, 4213.at n=8A116768
- a(n) = 5 + floor( Sum_{j=1..n-1} a(j)/3 ).at n=25A120151
- The base 6 numbers 4 44 444 4444 44444 ... converted to base 10.at n=4A125687
- 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), (-1, 1, 1), (0, 0, -1), (1, 0, 1)}.at n=8A149144
- a(n+1)-+a(n)=prime, a(n+1)*a(n)=Average of twin prime pairs, a(1)=2,a(2)=9.at n=28A154495
- Positive integers n such that the sum S of 1 and first n^2-1 odd primes is divisible by n and S/n == n (mod 2).at n=14A173079
- Smith numbers of order 2.at n=28A174460
- Convolution of A007947 with itself.at n=38A175703
- Triangle of coefficients of polynomials u(n,x) jointly generated with A208339; see the Formula section.at n=51A209152