971
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
- 972
- 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
- 970
- Möbius Function
- -1
- Radical
- 971
- 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
- 36
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 164
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- neunhunderteinundsiebzig· ordinal: neunhunderteinundsiebzigste
- English
- nine hundred seventy-one· ordinal: nine hundred seventy-first
- Spanish
- novecientos setenta y uno· ordinal: 971º
- French
- neuf cent soixante-onze· ordinal: neuf cent soixante-onzième
- Italian
- novecentosettantuno· ordinal: 971º
- Latin
- nongenti septuaginta unus· ordinal: 971.
- Portuguese
- novecentos e setenta e um· ordinal: 971º
Appears in sequences
- 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=63A000928
- Primes with 6 as smallest primitive root.at n=9A001125
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/5.at n=2A001135
- A sequence of sorted odd primes 3 = p_1 < p_2 < ... < p_m such that p_i-2 divides the product p_1*p_2*...*p_(i-1) of the earlier primes and each prime factor of p_i-1 is a prime factor of twice the product.at n=12A001259
- Expansion of 1/(1-x)^2/(1-x^2)/(1-x^6)/(1-x^12)/(1-x^24)/(1-x^48)/(1-x^60).at n=32A001365
- Full reptend primes: primes with primitive root 10.at n=57A001913
- Smallest prime p==3 (mod 8) such that Q(sqrt(-p)) has class number 2n+1.at n=7A002148
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=45A003147
- Number of 4-line partitions of n decreasing across rows.at n=15A003292
- Primes written backwards.at n=40A004087
- Divisible only by primes congruent to 5 mod 7.at n=42A004623
- Class 1+ primes: primes of the form 2^i*3^j - 1 with i, j >= 0.at n=18A005105
- Primes of the form k^2 + k + 41.at n=30A005846
- Primes p such that 2^p - 1 has at most 2 prime factors.at n=48A006514
- Emirps (primes whose reversal is a different prime).at n=33A006567
- No-3-in-line problem for equilateral triangle array of side n.at n=9A007402
- Primes whose reversal in base 10 is also prime (called "palindromic primes" by David Wells, although that name usually refers to A002385). Also called reversible primes.at n=53A007500
- Primes == 3 (mod 8).at n=43A007520
- Coordination sequence T2 for Zeolite Code FER.at n=19A008107
- Coordination sequence T4 for Zeolite Code -PAR.at n=22A009858