8612
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15078
- Proper Divisor Sum (Aliquot Sum)
- 6466
- 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
- 4304
- Möbius Function
- 0
- Radical
- 4306
- Omega Function (Ω)
- 3
- 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
- 78
- 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
- Sum of 12 nonzero 8th powers.at n=21A003390
- a(n) = (d(n)-r(n))/2, where d = A026046 and r is the periodic sequence with fundamental period (0,1,0,1).at n=33A026047
- Number of partitions in parts not of the form 19k, 19k+3 or 19k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=36A035972
- a(n) = T(n,2), array T as in A054134.at n=10A054136
- Sum of the first n twin prime pairs.at n=23A086169
- Number of compositions of n in which the greatest part is odd.at n=14A103421
- Triangle T read by rows: matrix product of Pascal and Catalan triangle.at n=49A104259
- Expansion of x*(1-x)/(1-x+2*x^3-x^4).at n=45A104554
- "Ceiling of hypotenuses": a(n) = ceiling(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.at n=33A104805
- Numbers k for which 8*k+1, 8*k+3 and 8*k+7 are primes.at n=42A123978
- Number of partitions of n in which each odd part has odd multiplicity.at n=37A131942
- Riordan array (1, (1/(1-x))c(x/(1-x))), c(x) the g.f. of A000108.at n=60A155887
- 1/4 the number of (n+1) X 5 0..2 arrays with every 2 X 2 subblock having distinct edge sums.at n=6A209378
- 1/4 the number of (n+1) X 8 0..2 arrays with every 2 X 2 subblock having distinct edge sums.at n=3A209381
- T(n,k)=1/4 the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having distinct edge sums.at n=48A209382
- T(n,k)=1/4 the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having distinct edge sums.at n=51A209382
- Floor of the expected value of number of trials until all cells are occupied in a random distribution of 2n balls in n cells.at n=51A210024
- Expansion of phi(q^2)^2 / (phi(-q) * phi(q^4)) in powers of q where phi() is a Ramanujan theta function.at n=17A212318
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2.at n=55A214023
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.at n=27A214038