683
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 684
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 682
- Möbius Function
- -1
- Radical
- 683
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 38
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 124
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- sechshundertdreiundachtzig· ordinal: sechshundertdreiundachtzigste
- English
- six hundred eighty-three· ordinal: six hundred eighty-third
- Spanish
- seiscientos ochenta y tres· ordinal: 683º
- French
- six cent quatre-vingt-trois· ordinal: six cent quatre-vingt-troisième
- Italian
- seicentoottantatre· ordinal: 683º
- Latin
- sescenti octoginta tres· ordinal: 683.
- Portuguese
- seiscentos e oitenta e três· ordinal: 683º
Appears in sequences
- Primes that divide at least one term in every Fibonacci sequence.at n=27A000057
- Primes p == 3, 9, 11 (mod 20) such that 2p+1 is also prime.at n=13A000355
- Irregular primes: primes p such that at least one of the numerators of the Bernoulli numbers B_2, B_4, ..., B_{p-3} (A000367) is divisible by p.at n=45A000928
- The convergent sequence B_n for the ternary continued fraction (3,1;2,2) of period 2.at n=9A000963
- Wagstaff primes: primes of form (2^p + 1)/3.at n=3A000979
- Jacobsthal sequence (or Jacobsthal numbers): a(n) = a(n-1) + 2*a(n-2), with a(0) = 0, a(1) = 1; also a(n) = nearest integer to 2^n/3.at n=11A001045
- Primes with 5 as smallest primitive root.at n=18A001124
- Table T(n,k) in which n-th row lists prime factors of 2^n - 1 (n >= 2), with repetition.at n=56A001265
- Table T(n,k) in which n-th row lists prime factors of 2^n + 1 (n >= 0), with repetition.at n=21A001269
- Numbers k such that phi(2k-1) < phi(2k), where phi is Euler's totient function A000010.at n=7A001836
- Cyclic numbers: 10 is a quadratic residue modulo p and class of mantissa is 2.at n=40A001914
- a(n) = least value of m for which Liouville's function A002819(m) = -n.at n=27A002053
- Smallest primitive factor of 2^(2n+1) + 1.at n=5A002185
- Lucasian primes: p == 3 (mod 4) with 2*p+1 prime.at n=15A002515
- Largest prime factor of 2^n + 1.at n=11A002587
- Largest primitive factor of 2^(2n+1) + 1.at n=5A002589
- Expansion of (1+x)(1+x^2)/(1-x-x^3).at n=16A003410
- Divisors of 2^22 - 1.at n=6A003531
- Divisors of 2^44 - 1.at n=12A003549
- Expansion of (1 + x - x^5) / (1 - x)^3.at n=32A004120