271
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 272
- 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
- 270
- Möbius Function
- -1
- Radical
- 271
- 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
- 42
- 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
- 58
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- zweihunderteinundsiebzig· ordinal: zweihunderteinundsiebzigste
- English
- two hundred seventy-one· ordinal: two hundred seventy-first
- Spanish
- doscientos setenta y uno· ordinal: 271º
- French
- deux cent soixante-onze· ordinal: deux cent soixante-onzième
- Italian
- duecentosettantuno· ordinal: 271º
- Latin
- ducenti septuaginta unus· ordinal: 271.
- Portuguese
- duzentos e setenta e um· ordinal: 271º
Appears in sequences
- From a fractal set of positive Lebesgue measure, a self-replicating tiling with holes, the 4-reptile following the 2-reptile of Paul Levy.at n=48A000361
- Number of nonnegative solutions to x^2 + y^2 <= n^2.at n=18A000603
- Numbers that are not the sum of 4 tetrahedral numbers.at n=19A000797
- Number of switching networks under action of AG_n(Z_2) acting on 2 variables.at n=2A000820
- Primes p of the form 3k+1 such that Sum_{x=1..p} cos(2*Pi*x^3/p) > sqrt(p).at n=12A000921
- 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=11A000928
- Number of plane partitions of n with at most two rows.at n=11A000990
- Union of all numbers {p, q} where p and q are both primes or powers of primes and q = p+2.at n=51A001092
- Twin primes.at n=34A001097
- Primes with 6 as smallest primitive root.at n=5A001125
- Primes == +-1 (mod 8).at n=26A001132
- a(n) is the solution to the postage stamp problem with n denominations and 3 stamps.at n=12A001213
- Table of prime factors of 10^n - 1 (with multiplicity).at n=44A001270
- Table of prime factors of 10^n - 1 (with multiplicity).at n=16A001270
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 20, 50 cents.at n=42A001313
- a(n) is the number of partitions of n into at most 3 parts; also partitions of n+3 in which the greatest part is 3; also number of unlabeled multigraphs with 3 nodes and n edges.at n=54A001399
- a(n) = -a(n-1) - 2*a(n-2).at n=17A001607
- Primes p such that the congruence 2^x = 5 (mod p) is solvable.at n=32A001916
- Prime determinants of forms with class number 2.at n=28A002052
- Wilson remainders: a(n) = ((p-1)!+1)/p mod p, where p = prime(n).at n=62A002068