8312
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15600
- Proper Divisor Sum (Aliquot Sum)
- 7288
- 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
- 4152
- Möbius Function
- 0
- Radical
- 2078
- Omega Function (Ω)
- 4
- 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
- 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
- If a, b in sequence, so is ab+8.at n=33A009331
- Bisection of A028289.at n=46A038390
- Triangles in open triangular matchstick arrangement (triangle minus one side) of side n.at n=32A045947
- a(n) = smallest k such that the base-2 Reverse and Add! trajectory of A075252(n) joins the trajectory of k.at n=32A092211
- Number of permutations of length n which avoid the patterns 321, 1342, 1423.at n=15A116730
- a(n) = n*(4*n^2 + n - 1)/2.at n=15A125200
- O.g.f.: A(x) = Sum_{n>=0} x^n / Product_{k=0..n} (1 - Fibonacci(k)*x).at n=9A135934
- Numerator of Hermite(n, 1/3).at n=5A158811
- Expansion of 1/(1 - x^5 - x^6 - x^7 - x^8 + x^13).at n=52A173924
- Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n.at n=88A181664
- Number of nX3 zero-sum -1..1 arrays with rows and columns lexicographically nondecreasing.at n=4A202028
- Number of nX5 zero-sum -1..1 arrays with rows and columns lexicographically nondecreasing.at n=2A202030
- T(n,k)=Number of nXk zero-sum -1..1 arrays with rows and columns lexicographically nondecreasing.at n=23A202033
- T(n,k)=Number of nXk zero-sum -1..1 arrays with rows and columns lexicographically nondecreasing.at n=25A202033
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 5.at n=26A209990
- Number of nX7 0..2 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=1A232022
- T(n,k)=Number of nXk 0..2 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=29A232023
- Number of 2 X n 0..2 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=6A232024
- a(n) is the number of primes occurring between A053182(n) and A053183(n) (excluding the endpoints).at n=12A238399
- Subdiagonal partitions: number of partitions (p1, p2, p3, ...) of n with pi <= i.at n=36A238875