601
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 602
- 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
- 600
- Möbius Function
- -1
- Radical
- 601
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 56
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 110
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- sechshunderteins· ordinal: sechshunderteinsste
- English
- six hundred one· ordinal: six hundred first
- Spanish
- seiscientos uno· ordinal: 601º
- French
- six cent un· ordinal: six cent unième
- Italian
- seicentouno· ordinal: 601º
- Latin
- sescenti unus· ordinal: 601.
- Portuguese
- seiscentos e um· ordinal: 601º
Appears in sequences
- Numbers m such that Fibonacci(m) ends with m.at n=21A000350
- Numbers beginning with letter 's' in English.at n=25A000870
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=9A000923
- Twin primes.at n=52A001097
- Primes with 7 as smallest primitive root.at n=7A001126
- Cyclic numbers: 10 is a quadratic residue modulo p and class of mantissa is 2.at n=36A001914
- Central polygonal numbers: a(n) = n^2 - n + 1.at n=25A002061
- From a Goldbach conjecture: records in A185091.at n=15A002092
- Pythagorean primes: primes of the form 4*k + 1.at n=51A002144
- a(n) = least primitive factor of 2^(2n+1) - 1.at n=12A002184
- Primes of the form 2^q*3^r*5^s + 1.at n=29A002200
- Primes congruent to 1 or 2 modulo 4; or, primes of form x^2 + y^2; or, -1 is a square mod p.at n=52A002313
- Primes of form k^2 + k + 1.at n=12A002383
- Primes of the form 6m + 1.at n=50A002476
- a(n) = 2*a(n-1) + 9*a(n-2), with a(0)=a(1)=1.at n=5A002535
- Sextan primes: p = (x^6 + y^6)/(x^2 + y^2).at n=6A002647
- Erroneous version of A108919.at n=6A002792
- a(n) = 3^(n-1) - 2^n.at n=6A003063
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=34A003147
- a(n) = a(n-1) + 2*a(n-3).at n=12A003476