273
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 448
- Proper Divisor Sum (Aliquot Sum)
- 175
- 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
- 144
- Möbius Function
- -1
- Radical
- 273
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 29
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- zweihundertdreiundsiebzig· ordinal: zweihundertdreiundsiebzigste
- English
- two hundred seventy-three· ordinal: two hundred seventy-third
- Spanish
- doscientos setenta y tres· ordinal: 273º
- French
- deux cent soixante-treize· ordinal: deux cent soixante-treizième
- Italian
- duecentosettantatre· ordinal: 273º
- Latin
- ducenti septuaginta tres· ordinal: 273.
- Portuguese
- duzentos e setenta e três· ordinal: 273º
Appears in sequences
- Central factorial numbers: A008955(n,2).at n=2A000596
- Moser-de Bruijn sequence: sums of distinct powers of 4.at n=21A000695
- Expansion of Product_{n>=1} (1 - x^n)^7.at n=26A000730
- Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers).at n=50A000926
- Lucky numbers.at n=51A000959
- Expansion of g.f. (1 + x + 2*x^2)/((1 - x)^2*(1 - x^3)).at n=19A000969
- Fermat coefficients.at n=5A000970
- Numbers that are divisible by at least three different primes.at n=49A000977
- sigma_4(n): sum of 4th powers of divisors of n.at n=3A001159
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)).at n=21A001304
- Number of ways of making change for n cents using coins of 1, 2, 4, 10 cents.at n=42A001362
- Number of ways of making change for n cents using coins of 1, 2, 4, 10 cents.at n=43A001362
- a(n) = 9*binomial(2n,n-4)/(n+5).at n=3A001392
- a(n) = 1^n + 2^n + 4^n.at n=4A001576
- Golden rectangle numbers: F(n) * F(n+1), where F(n) = A000045(n) (Fibonacci numbers).at n=7A001654
- Fibonomial coefficients.at n=2A001658
- a(n) = binomial(3*n,n)/(2*n+1) (enumerates ternary trees and also noncrossing trees).at n=5A001764
- Central factorial numbers: 2nd subdiagonal of A008955.at n=2A001820
- Expansion of g.f. x/((1 - x)^2*(1 - x^3)).at n=39A001840
- Sorting numbers: maximal number of comparisons for sorting n elements by binary insertion.at n=55A001855