8062
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12600
- Proper Divisor Sum (Aliquot Sum)
- 4538
- 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
- 3864
- Möbius Function
- -1
- Radical
- 8062
- 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
- 96
- 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
- "BIK" (reversible, indistinct, unlabeled) transform of A000237.at n=9A035350
- Number of tilings of 2 X n rectangle with polyominoes, each of which has area = # of adjacent polyominoes.at n=17A044043
- a(n) = A006496(n)/2.at n=14A045873
- T(n,n-3), array T as in A047120.at n=7A047125
- T(n,n-3), array T as in A054110.at n=26A054112
- Integer part of log(n^n)^log(n).at n=12A062431
- Numbers k such that 1000k+1, 1000k+3, 1000k+7, 1000k+9 are all primes.at n=5A064962
- Partial sums of A068058 + 1.at n=38A068059
- Let s(k) denote the k-th term of an integer sequence such that s(0)=0 and s(i) for all i>0 is the least natural number such that no four elements of {s(0),..,s(i)} are in arithmetic progression. Then it appears that there are many set of 3 consecutive integers in s(k). Sequence gives the smallest element in those triples.at n=28A071711
- Smallest stack size with an unentailed Grundy value of 2^n in Top Entails.at n=7A081198
- a(n) = numerator of any non-diagonal entry of the matrix A^n, where A is described in the Comments lines.at n=6A093378
- Maximum determinant that can be formed from the optimal set of nonnegative 3 X 3 matrix elements <=n, which maximize the number of different determinants given in A099834.at n=19A099815
- Denominators of the convergents of the continued fraction for L(3, chi3), where L(s, chi3) is the Dirichlet L-function for the non-principal character modulo 3.at n=13A129659
- a(n) = 2^n - n*(n-3).at n=13A176777
- Number of (n+2) X 4 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..1 introduced in row major order.at n=14A204375
- Number of (w,x,y,z) with all terms in {1,...,n} and 3w<x+y+z+n.at n=10A212249
- Bernoulli number B_{n} has denominator 354.at n=19A255684
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 318", based on the 5-celled von Neumann neighborhood.at n=24A287628
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 419", based on the 5-celled von Neumann neighborhood.at n=24A288062
- G.f. A(x) satisfies: (1 - x) = A(x)*A(x^2)^2*A(x^3)^3*A(x^4)^4* ... *A(x^k)^k* ...at n=37A307656