3397
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3520
- Proper Divisor Sum (Aliquot Sum)
- 123
- 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
- 3276
- Möbius Function
- 1
- Radical
- 3397
- Omega Function (Ω)
- 2
- 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
- 61
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1.at n=34A005424
- Coordination sequence T2 for Zeolite Code TER.at n=39A016434
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite EUO = EU-1 Nan[AlnSi112-nO224] starting with a T6 atom.at n=11A019125
- Coordination sequence T3 for Zeolite Code CZP.at n=38A019458
- Pseudoprimes to base 80.at n=27A020208
- Numbers k such that the continued fraction for sqrt(k) has period 82.at n=5A020421
- For n>0, a(n) is the least quasi-Carmichael number to base n; a(0) = least composite squarefree integer.at n=37A029590
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 30 ones.at n=14A031798
- Denominators of continued fraction convergents to sqrt(864).at n=9A042669
- Numbers whose base-15 representation has exactly 4 runs.at n=6A043671
- Numbers n such that string 9,7 occurs in the base 10 representation of n but not of n-1.at n=36A044429
- Numbers n such that string 9,7 occurs in the base 10 representation of n but not of n+1.at n=36A044810
- Numbers k such that 135*2^k-1 is prime.at n=20A050593
- Number of positive integers <= 2^n of form 3 x^2 + 10 y^2.at n=15A054167
- Number of positive integers <= 2^n of form 5 x^2 + 6 y^2.at n=15A054176
- Numbers k such that k^10 == 1 (mod 11^3).at n=26A056085
- Composite numbers not divisible by 2 or 3 which in base 3 contain their largest proper factor as a substring.at n=8A063132
- Duplicate of A063132.at n=8A063874
- n coded as binary word of length=n with k-th bit set iff k is prime (1<=k<=n), decimal value.at n=12A072762
- Diagonal of A083167.at n=43A083168