379
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 380
- 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
- 378
- Möbius Function
- -1
- Radical
- 379
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- 75
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- dreihundertneunundsiebzig· ordinal: dreihundertneunundsiebzigste
- English
- three hundred seventy-nine· ordinal: three hundred seventy-ninth
- Spanish
- trescientos setenta y nueve· ordinal: 379º
- French
- trois cent soixante-dix-neuf· ordinal: trois cent soixante-dix-neufième
- Italian
- trecentosettantanove· ordinal: 379º
- Latin
- trecenti septuaginta novem· ordinal: 379.
- Portuguese
- trezentos e setenta e nove· ordinal: 379º
Appears in sequences
- Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.at n=27A000124
- Primes p of the form 3k+1 such that -sqrt(p) < sum_{x=1..p} cos(2*Pi*x^3/p) < sqrt(p).at n=11A000922
- 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=18A000928
- Primes with primitive root 2.at n=30A001122
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 50, 100 cents.at n=52A001312
- Number of hill-free Dyck paths of semilength n+3 and having length of first descent equal to 1 (a hill in a Dyck path is a peak at level 1).at n=5A001558
- Full reptend primes: primes with primitive root 10.at n=26A001913
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=43A001915
- Primes p such that the congruence 2^x = 5 (mod p) is solvable.at n=40A001916
- Prime determinants of forms with class number 2.at n=35A002052
- Generalized sum of divisors function.at n=21A002130
- Primes of the form 4*k + 3.at n=38A002145
- Primes of the form k^2 - k - 1.at n=12A002327
- Primes of the form 6m + 1.at n=35A002476
- Numbers k such that (k^2 + 1)/2 is prime.at n=58A002731
- Number of distinct values taken by 2^2^...^2 (with n 2's and parentheses inserted in all possible ways).at n=10A002845
- Numbers k such that k! - 1 is prime.at n=13A002982
- a(n) = smallest number with shortest addition chain of length n.at n=12A003064
- Continued fraction for fifth root of 3.at n=44A003117
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=21A003147