8068
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 14126
- Proper Divisor Sum (Aliquot Sum)
- 6058
- 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
- 4032
- Möbius Function
- 0
- Radical
- 4034
- 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
- 70
- 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
- Number of steps to compute n-th prime in PRIMEGAME (fast version).at n=6A007546
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=19A015992
- Number of lines through exactly 6 points of an n X n grid of points.at n=48A018813
- Ordered sequence of distinct terms of the form floor(exp(i) * floor(exp(j))), i,j >= 0.at n=39A022765
- [ exp(8/17)*n! ].at n=6A030892
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 54 ones.at n=19A031822
- a() = 1,3,... [ A037257 ], differences = 2,... [ A037258 ] and 2nd differences [ A037259 ] are disjoint and monotonic; adjoin next free number to 2nd differences unless it would produce a duplicate in which case ignore.at n=31A037257
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) <= cn(1,5) + cn(4,5) + cn(3,5).at n=32A039844
- Numbers whose base-6 representation has exactly 6 runs.at n=28A043614
- Heights of peaks of more than 8000 meters (as of Sep 25 2001), in decreasing order.at n=10A064296
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=18A065216
- Number of hands that peg n points in the "show" phase of 6-card cribbage.at n=20A066354
- a(0)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)= 1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals 2n.at n=45A070898
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A071665/A071666.at n=12A089872
- Finite sequence of iterations at which Langton's Ant passes through the origin.at n=28A102358
- Shadow of sqrt(2).at n=43A110557
- Number of sets {p, p'}, where p is a partition of n and p' is conjugate partition of p such that p and p' have no common parts.at n=59A114701
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n such that the bottom of the last column is at level k (n>=1; k>=0). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=24A121632
- Half the number of n X n binary matrices, symmetric about both diagonal and antidiagonal, having equal row sums.at n=7A140989
- 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, 0, 1), (0, 1, 0), (1, -1, 1), (1, 1, -1)}.at n=9A148365