3193
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3328
- Proper Divisor Sum (Aliquot Sum)
- 135
- 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
- 3060
- Möbius Function
- 1
- Radical
- 3193
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 35
- 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
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = a(1) = 1.at n=16A001595
- Coordination sequence T3 for Zeolite Code AET.at n=39A008009
- Coordination sequence T3 for Zeolite Code DAC.at n=36A008069
- Coordination sequence T1 for Zeolite Code NON.at n=34A008212
- Coordination sequence T4 for Zeolite Code VET.at n=34A009905
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/23 ).at n=18A011933
- a(n) is the concatenation of n and 3n.at n=30A019551
- Pseudoprimes to base 56.at n=27A020184
- Pseudoprimes to base 57.at n=28A020185
- Strong pseudoprimes to base 56.at n=7A020282
- Strong pseudoprimes to base 57.at n=7A020283
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=2A020413
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=30A024835
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 38 ones.at n=6A031806
- Numbers whose set of base-7 digits is {1,2}.at n=42A032928
- Inverse Stolarsky array read by antidiagonals.at n=52A035507
- Numbers n such that string 9,3 occurs in the base 10 representation of n but not of n-1.at n=34A044425
- Numbers k such that the digit string 9,3 occurs in the base-10 representation of k but not of k+1.at n=34A044806
- Becomes prime after exactly 6 iterations of f(x) = sum of prime factors of x.at n=28A047825
- Becomes prime or 4 after exactly 7 iterations of f(x) = sum of prime factors of x.at n=36A048129