3406
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5544
- Proper Divisor Sum (Aliquot Sum)
- 2138
- 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
- 1560
- Möbius Function
- -1
- Radical
- 3406
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 61
- 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
- Continued cotangent for square root of 2.at n=3A002666
- Number of restricted 3 X 3 matrices with row and column sums n.at n=33A005045
- Les Marvin sequence: a(n) = F(n) + (n-1)*F(n-1), F() = Fibonacci numbers.at n=13A007502
- Coordination sequence T2 for Zeolite Code AFT.at n=44A008027
- a(n) = a(n-3) + a(n-4), with a(0)=1, a(1)=a(2)=0, a(3)=1.at n=47A017817
- Pseudoprimes to base 53.at n=35A020181
- Pseudoprimes to base 61.at n=32A020189
- Numbers k such that the continued fraction for sqrt(k) has period 46.at n=19A020385
- Fibonacci sequence beginning 1, 14.at n=13A022104
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (odd natural numbers).at n=17A025106
- a(n) = floor(n^3 / e).at n=21A032636
- Decimal part of n-th root of a(n) starts with digit 3.at n=29A034080
- Number of 4-ary rooted trees with n nodes and height at most 7.at n=12A036612
- Numbers having four 1's in base 5.at n=33A043356
- Numbers whose base-15 representation has exactly 4 runs.at n=15A043671
- Numbers n such that string 0,6 occurs in the base 10 representation of n but not of n-1.at n=36A044338
- Numbers n such that string 0,6 occurs in the base 10 representation of n but not of n+1.at n=36A044719
- Composite numbers whose 3 prime factors are distinct in length.at n=19A046443
- 3*n^2-2*n+6.at n=34A047915
- Numbers n such that Catalan(n)-1 is prime.at n=29A053427