8346
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 9798
- 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
- 2544
- Möbius Function
- 1
- Radical
- 8346
- 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
- 127
- 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
- a(n) = n*(11*n - 1)/2.at n=39A022268
- a(n) = Sum(a(2i-1)*a(n-2i+1), i = 1,2,...,[ (n+2)/4 ]).at n=22A024965
- Numbers having period-2 6-digitized sequences.at n=27A031357
- Numerators of continued fraction convergents to sqrt(393).at n=9A041746
- Numbers whose base-4 representation contains exactly two 0's and four 2's.at n=26A045051
- Numbers k such that k | 11^k + 10^k + 9^k + 8^k.at n=14A057240
- Numbers n such that A001414(n) = sum of squared digits of n.at n=16A094908
- The first 10 digits of the fifth root of n contain the digits 0-9.at n=4A119520
- The first 8 values are predefined, the remaining set to a(n) = 48*prime(n)+n+2.at n=39A129025
- Erroneous version of A140763.at n=23A159579
- Costas arrays such that the corresponding permutation is a derangement.at n=14A213271
- Numbers k such that 4^k + k^4 + 1 is prime.at n=4A216423
- Numbers n such that sum of squares of digits of n equals the sum of prime divisors of n.at n=19A217390
- The number of 3-length segments in all possible covers of L-length line by these segments with allowed gaps < 3.at n=27A228494
- Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7.at n=4A252402
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7.at n=25A252407
- Number of (5+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7.at n=2A252412
- Indices of zeros in A269783.at n=38A269967
- Numbers n = concat(s,t) such that n = (Fibonacci(s) mod n) + (Fibonacci(t) mod n).at n=45A272767
- Least number k such that A001844(k) (sums of two consecutive squares) is the sum of two nonzero squares in exactly n ways.at n=13A273787