6365
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8160
- Proper Divisor Sum (Aliquot Sum)
- 1795
- 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
- 4752
- Möbius Function
- -1
- Radical
- 6365
- 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
- 106
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = Fibonacci(n) - n^2.at n=20A014283
- Expansion of 1/((1-4x)(1-10x)(1-11x)).at n=3A019742
- Convolution of natural numbers with Beatty sequence for the golden mean A000201.at n=27A023541
- n written in fractional base 9/6.at n=41A024654
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 3 (mod 4).at n=40A035550
- A035550 with periodic zeros stripped.at n=19A035595
- 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n-7)/2.at n=38A051682
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 8.at n=31A051973
- Numbers k such that (2^k + 1)^2 - 2 = 4^k + 2^(k+1) - 1 is prime.at n=35A091513
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 67, the third irregular prime.at n=6A093059
- Irregular triangle read by rows T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs (V,E') with |E'|=k of the complete labeled graph K_n=(V,E).at n=31A125205
- Triangular array T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs obtained from the complete labeled graph K_n by removing k edges.at n=34A125206
- Fibonacci sequence rewritten using A006942.at n=20A172439
- Exactly one of (2^n-1)^2-2 and (2^n+1)^2-2 is prime.at n=49A173888
- Wiener index of a benzenoid consisting of a double-step zig-zag chain of n hexagons (n >= 2, s = 2123; see the Gutman et al. reference).at n=8A193395
- Number of (n+3) X 4 binary arrays with no more than one of any consecutive four bits set in any row or column.at n=3A203041
- Number of (n+3)X7 binary arrays with no more than one of any consecutive four bits set in any row or column.at n=0A203044
- T(n,k)=Number of (n+3)X(k+3) binary arrays with no more than one of any consecutive four bits set in any row or column.at n=6A203048
- T(n,k)=Number of (n+3)X(k+3) binary arrays with no more than one of any consecutive four bits set in any row or column.at n=9A203048
- D-toothpick sequence of the third kind starting with a single toothpick.at n=51A220500