275
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 372
- Proper Divisor Sum (Aliquot Sum)
- 97
- 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
- 200
- Möbius Function
- 0
- Radical
- 55
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 91
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- zweihundertfünfundsiebzig· ordinal: zweihundertfünfundsiebzigste
- English
- two hundred seventy-five· ordinal: two hundred seventy-fifth
- Spanish
- doscientos setenta y cinco· ordinal: 275º
- French
- deux cent soixante-quinze· ordinal: deux cent soixante-quinzième
- Italian
- duecentosettantacinque· ordinal: 275º
- Latin
- ducenti septuaginta quinque· ordinal: 275.
- Portuguese
- duzentos e setenta e cinco· ordinal: 275º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=46A000008
- a(n) = n*(n+3)/2.at n=22A000096
- a(n) = 5*binomial(2n, n-2)/(n+3).at n=4A000344
- a(n) = Sum_{k=1..n-1} k^2*sigma(k)*sigma(n-k).at n=4A000477
- Number of boron trees with n nodes, i.e. n-node rooted trees with degree <= 3 at root and out-degree <= 2 elsewhere.at n=10A000671
- Number of bicentered 3-valent (or boron, or binary) trees with n nodes.at n=14A000673
- Expansion of bracket function.at n=8A000750
- a(n) = floor(n*log((14/11)*n^(10/9))).at n=57A001195
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 50, 100 cents.at n=46A001312
- a(n+6) = -a(n+5) + a(n+4) + 3a(n+3) + a(n+2) - a(n+1) - a(n). a(n) = sign(n) if abs(n)<=3.at n=20A001945
- Numerators of logarithmic numbers (also of Gregory coefficients G(n)).at n=7A002206
- a(n) = a(n-1) - 2*a(n-2) with a(0) = 2, a(1) = 1.at n=15A002249
- Numbers y such that p^2 = x^2 + y^2, 0 < x < y, p = A002144(n).at n=34A002365
- Numbers k such that binomial(2*k,k) is divisible by (k+1)^2.at n=24A002503
- Earliest sequence with a(a(n))=5n.at n=60A002518
- a(n) = Sum_{d|n, d <= 3} d^2 + 3*Sum_{d|n, d>3} d.at n=49A002660
- Numbers k such that (k^2 + 1)/2 is prime.at n=44A002731
- Number of rooted trees with n vertices in which vertices at the same level have the same degree.at n=26A003238
- a(n) = A001950(A003234(n)) + 1.at n=27A003249
- The number m such that A001950(m) = A003231(A003234(n)).at n=54A003250