6366
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12744
- Proper Divisor Sum (Aliquot Sum)
- 6378
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2120
- Möbius Function
- -1
- Radical
- 6366
- Omega Function (Ω)
- 3
- 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
- 62
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite RSN = RUB-17 K4Na12[Zn8Si28O72].18H2O starting with a T4 atom.at n=12A019218
- n written in fractional base 9/6.at n=42A024654
- Numbers having three 6's in base 10.at n=9A043515
- Number of rooted 2-dimensional polyominoes with n pentagonal cells, with no symmetries removed.at n=5A051738
- One half of the number of non-self-conjugate balanced partitions.at n=51A067772
- Triangle T(n,k) (n >= 2, 1 <= k <= n-1) read by rows, where T(n,k) is the number of words of length n in the free group on three generators that require exactly k multiplications for their formation.at n=33A076262
- Array read by antidiagonals: T(n,k) = number of rooted 2-dimensional polyominoes with k cells, the cells being regular n-gons, with no symmetries removed.at n=33A094166
- Duplicate of A051738.at n=5A094167
- Positive integers n such that n^11 + 1 is semiprime.at n=32A105122
- Numbers k such that k + sigma(k) is a triangular number.at n=31A115904
- Number of permutations of length n that avoid the patterns 321, 1342, 4123.at n=14A116714
- 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=38A117625
- The number of permutations p of {1,...,n} such that |p(i)-p(i+1)| is in {2,3} for all i from 1 to n-1.at n=20A174703
- Number of 3X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 3 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=39A192701
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of one or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=19A227161
- Number of partitions p of n such that (number of distinct parts of p) >= max(p) - min(p).at n=44A239958
- Number of (n+2) X (6+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 3.at n=34A255799
- Expansion of Product_{n>=1} (1 - x^(6*n))/(1 - x^n)^6 in powers of x.at n=7A277283
- Numbers n with digits 3 and 6 only.at n=25A284633
- Ulam numbers k such that 4*k and 16*k are also Ulam numbers.at n=8A287634