8327
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9096
- Proper Divisor Sum (Aliquot Sum)
- 769
- 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
- 7560
- Möbius Function
- 1
- Radical
- 8327
- Omega Function (Ω)
- 2
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 65
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Expansion of x*(1+x-x^2)/((1-x)^4*(1+x)).at n=44A005744
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=42A024305
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=47A024843
- Nearest integer to n^(5/2).at n=37A036488
- In ternary expansion of n, reading from right to left, digits occur in order ...,0,1,2,0,1,2,...at n=17A037078
- Base-3 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,2.at n=8A037496
- a(n) = 4*n^2 - 3*n + 1.at n=46A054552
- a(n) = n^2 + (n^2 with digits reversed).at n=44A061226
- Non-palindromic numbers such that the two largest proper divisors are palindromes having at least two digits and no other divisor is a palindrome with at least two digits.at n=13A074889
- Numbers k such that 7*10^k + 6*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=22A103065
- Semiprimes in A054552.at n=15A113690
- Nearest integer to the space diagonal of the smallest (measured by the longest edge) primitive (gcd(a,b,c)=1) Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers). If the space diagonal is an integer then the Euler brick is called a "perfect cuboid". There are no known perfect cuboids.at n=15A141029
- Number of n X n binary arrays with all ones connected only in a 1110-0110-0111 pattern in any orientation.at n=7A147497
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1110-0110-0111 pattern in any orientation.at n=16A147499
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1110-0110-0111 pattern in any orientation.at n=17A147499
- Integer part of square root of n^5 = A000584(n).at n=36A155013
- Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=15A192960
- Number of nX7 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=3A207268
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=48A207269
- Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=6A207271