8362
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12996
- Proper Divisor Sum (Aliquot Sum)
- 4634
- 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
- -1
- Radical
- 8362
- 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
- 34
- 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
- Number of binary vectors of length n containing no singletons.at n=20A006355
- Numbers k such that the continued fraction for sqrt(k) has period 23.at n=34A020362
- Number of symmetrically inequivalent coincidence rotations of icosian ring of index n.at n=80A031366
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 20.at n=2A031608
- Dirichlet convolution of Fibonacci numbers with themselves.at n=18A034744
- Number of distinct permutations generated by shuffling n cards with "clump size" <= 2.at n=16A047992
- Expansion of 2*x*(1 - x)/(1 - 3*x + x^2).at n=10A052995
- Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3,Pi/3,0) (this is the classical modular tessellation).at n=17A054886
- a(0) = 1, then twice the Fibonacci sequence.at n=19A055389
- Row sums of array T in A055818; twice the odd-indexed Fibonacci numbers after initial term.at n=10A055819
- Lexicographical-support sequence T(n,k), n,k nonnegative: total number of checks required by a "lexicographical" algorithm to find out which rows and columns of each of the n by k zero-one matrices are nonzero.at n=30A058547
- McKay-Thompson series of class 42d for Monster.at n=47A058678
- a(n) = round(sqrt(a(n-2)^2 + a(n-1)^2)) with a(0) = 1 and a(1) = 2.at n=36A063827
- Number of primes q such that phiter(q)=n where phiter(n)=A064415(n).at n=14A064674
- Sum over all subsets of {1,..,n} of the GCD of the subset.at n=12A065568
- Number of ways to tile a 3 X 2n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=17A068922
- Sum of squares of digits of n is equal to the largest prime factor of n.at n=23A074302
- Numbers with two representations as the sum of two Fibonacci numbers.at n=16A078642
- Wythoff difference array, D={d(i,j)}, by antidiagonals.at n=57A080164
- Triangle T(n,k) read by rows, given by [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, ...] DELTA [1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, ...] where DELTA is the operator defined in A084938.at n=52A086329