8106
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18624
- Proper Divisor Sum (Aliquot Sum)
- 10518
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2304
- Möbius Function
- 1
- Radical
- 8106
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 114
- 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
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 30.at n=5A031708
- Numbers whose base-4 representation contains exactly four 2's and two 3's.at n=29A045155
- Numbers k such that the period of the continued fraction for sqrt(3)*k is 2.at n=46A064933
- Least nontrivial multiple of the n-th prime beginning with 8.at n=43A078292
- d(n,s) = number of perfect matchings on {1, 2, ..., n} with s short pairs.at n=51A079267
- Write the natural numbers as an infinite sequence of digits, starting at the left; a(n) is the subset (i.e., the position in this sequence of the "counting digits") of the first digit of the n-th square.at n=47A105314
- a(1) = 1; a(n) = max{ 5*a(k) + a(n-k) | 1 <= k <= n/2 } for n > 1.at n=37A130667
- a(n) = 225*n^2 + n.at n=5A156814
- a(n) = 900*n^2 + 2*n.at n=2A158406
- a(n) = 36*n^2 + 6.at n=14A158479
- Ordered forests of k increasing unordered trees on the vertex set {1,2,...,n} in which all outdegrees are <= 2.at n=23A185421
- The maximum possible value for the apex of a triangle of numbers whose base consists of a permutation of the numbers 0 to n, and each number in a higher row is the sum of the two numbers directly below it.at n=10A189390
- Triangle T(n,k), read by rows, given by (2,0,3,0,4,0,5,0,6,0,7,0,8,0,9,...) DELTA (2,1,3,2,4,3,5,4,6,5,7,6,8,7,9,...) where DELTA is the operator defined in A084938.at n=23A199400
- Positions of 3's in A234323.at n=4A234804
- a(n) gives one fourth of the even leg of one of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. The odd leg is given in A253802(n).at n=19A253803
- Squarefree kernel of A255334: a(n) = A007947(A255334(n)).at n=57A255424
- Numbers divisible by prime(d) for each digit d in their base-5 representation, none of which may be zero.at n=51A256875
- Number of compositions of n into distinct parts where each part i is marked with a word of length i over a septenary alphabet whose letters appear in alphabetical order.at n=5A261845
- Decimal representation of the n-th iteration of the "Rule 195" elementary cellular automaton starting with a single ON (black) cell.at n=6A267675
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 342", based on the 5-celled von Neumann neighborhood.at n=27A269511