6386
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9984
- Proper Divisor Sum (Aliquot Sum)
- 3598
- 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
- 3060
- Möbius Function
- -1
- Radical
- 6386
- 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
- 36
- 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
- a(n) = Sum_{k=0..n} binomial(n,k^2).at n=15A003099
- Positive integers n such that 2^n == 2^11 (mod n).at n=64A015935
- Least k such that first k terms of A022300 contain n more 2's than 1's.at n=3A025515
- Numbers k such that k^512 + 1 is prime.at n=20A057465
- Numbers k such that p(k), p(k)+6, p(k)+12, p(k)+18 are consecutive primes, where p(k) denotes k-th prime.at n=22A090832
- Numbers n such that p(n),p(n)+6,p(n)+12,p(n)+18 are consecutive primes and p(n)=6*k+1 for some k, where p(n) denotes n-th prime.at n=10A090838
- Numbers k such that 7*10^k + 3*R_k + 6 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=9A103056
- Numbers k such that k^4 contains a pandigital substring.at n=13A115934
- A 4 X 4 permutation-free magic square with magic sum 19998.at n=9A125522
- Row sums of triangle A134464.at n=30A134465
- 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, 0, 0), (0, -1, 1), (0, 0, -1), (1, 1, 0)}.at n=8A149181
- G.f. satisfies: A(x) = Sum_{n>=0} x^(n(n+1)/2) * A(x)^n.at n=14A157133
- Length of the n-th term in the modified Look and Say sequence A110393.at n=32A179999
- Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock having nonzero determinant and having the same number of clockwise edge increases as its horizontal and vertical neighbors.at n=4A206121
- Number of (n+1)X6 0..2 arrays with every 2X2 subblock having nonzero determinant and having the same number of clockwise edge increases as its horizontal and vertical neighbors.at n=0A206125
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having nonzero determinant and having the same number of clockwise edge increases as its horizontal and vertical neighbors.at n=10A206128
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having nonzero determinant and having the same number of clockwise edge increases as its horizontal and vertical neighbors.at n=14A206128
- Number of n X 5 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 5 array.at n=17A219499
- Numbers n such that n + prime(n), n + 1 + prime(n+1) and n + 2 + prime(n+2) are divisible by 7.at n=39A239457
- Number of partitions p of n such that the number of parts having multiplicity 1 is a part and max(p) - min(p) is a part.at n=42A241447