279
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 416
- Proper Divisor Sum (Aliquot Sum)
- 137
- 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
- 180
- Möbius Function
- 0
- Radical
- 93
- 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
- 42
- 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
- zweihundertneunundsiebzig· ordinal: zweihundertneunundsiebzigste
- English
- two hundred seventy-nine· ordinal: two hundred seventy-ninth
- Spanish
- doscientos setenta y nueve· ordinal: 279º
- French
- deux cent soixante-dix-neuf· ordinal: deux cent soixante-dix-neufième
- Italian
- duecentosettantanove· ordinal: 279º
- Latin
- ducenti septuaginta novem· ordinal: 279.
- Portuguese
- duzentos e setenta e nove· ordinal: 279º
Appears in sequences
- Coefficients of the 3rd-order mock theta function f(q).at n=41A000025
- Coefficient of q^(2n-1) in the series expansion of Ramanujan's mock theta function f(q).at n=20A000199
- n! never ends in this many 0's.at n=54A000966
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25 cents.at n=44A001301
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25, 50 cents.at n=44A001302
- Sorting numbers: maximal number of comparisons for sorting n elements by binary insertion.at n=56A001855
- Numbers x such that x^2 + y^2 = p^2 = A002144(n)^2, x < y.at n=45A002366
- Numbers k such that (k^2 + 1)/2 is prime.at n=45A002731
- Numbers k such that (4*k^2 + 1)/5 is prime.at n=45A002732
- (Presumed) solution to Waring's problem: g(n) = 2^n + floor((3/2)^n) - 2.at n=7A002804
- The number m such that A001950(m) = A003231(A003234(n)).at n=55A003250
- Binary entropy function: a(1)=0; for n > 1, a(n) = n + min { a(k)+a(n-k) : 1 <= k <= n-1 }.at n=48A003314
- Numbers that are the sum of 9 positive 4th powers.at n=29A003343
- Numbers that are the sum of 6 positive 5th powers.at n=8A003351
- Divisors of 2^30 - 1.at n=15A003538
- Sum of digits of n!.at n=52A004152
- Sum of digits of n!.at n=55A004152
- Sum of digits of n!.at n=53A004152
- Numbers that are the sum of 4 but no fewer nonzero squares.at n=44A004215
- Divisible only by primes congruent to 3 mod 7.at n=21A004621