571
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 572
- 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
- 570
- Möbius Function
- -1
- Radical
- 571
- 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
- 30
- 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
- 105
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- fünfhunderteinundsiebzig· ordinal: fünfhunderteinundsiebzigste
- English
- five hundred seventy-one· ordinal: five hundred seventy-first
- Spanish
- quinientos setenta y uno· ordinal: 571º
- French
- cinq cent soixante-onze· ordinal: cinq cent soixante-onzième
- Italian
- cinquecentosettantuno· ordinal: 571º
- Latin
- quingenti septuaginta unus· ordinal: 571.
- Portuguese
- quinhentos e setenta e um· ordinal: 571º
Appears in sequences
- Number of solutions to the rook problem on an n X n board having a certain symmetry group (see Robinson for details).at n=6A000899
- Primes p of the form 3k+1 such that -sqrt(p) < sum_{x=1..p} cos(2*Pi*x^3/p) < sqrt(p).at n=14A000922
- Twin primes.at n=50A001097
- Primes with 3 as smallest primitive root.at n=23A001123
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/5.at n=1A001135
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)*(1-x^10)*(1-x^20)).at n=25A001305
- Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents.at n=50A001310
- Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents.at n=51A001310
- Indices of prime Fibonacci numbers.at n=20A001605
- a(n) = 4*a(n-1) - a(n-2), with a(0) = 1, a(1) = 1.at n=6A001835
- Total diameter of unlabeled trees with n nodes.at n=9A001851
- Full reptend primes: primes with primitive root 10.at n=38A001913
- G.f.: (1+x)^2/[(1-x)^4(1-x-x^2)^3].at n=4A001926
- Prime determinants of forms with class number 2.at n=48A002052
- Primes of the form 4*k + 3.at n=54A002145
- Smallest primitive factor of 2^(2n+1) + 1.at n=28A002185
- Primes of the form 6m + 1.at n=48A002476
- a(n) = 4*a(n-2) - a(n-4) for n > 1, a(n) = n for n = 0, 1.at n=11A002530
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=32A003147
- a(n) = a(n-1) + a(n-5); a(0) = ... = a(4) = 1.at n=25A003520