4379
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4560
- Proper Divisor Sum (Aliquot Sum)
- 181
- 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
- 4200
- Möbius Function
- 1
- Radical
- 4379
- Omega Function (Ω)
- 2
- 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
- 214
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
Appears in sequences
- Numbers that are the sum of 7 positive 7th powers.at n=15A003374
- a(n) = ceiling(n*phi^11), where phi is the golden ratio, A001622.at n=22A004966
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 10.at n=14A022315
- Coordination sequence T5 for Zeolite Code CFI.at n=44A033603
- Denominators of continued fraction convergents to sqrt(44).at n=13A041075
- Numerators of continued fraction convergents to sqrt(411).at n=5A041780
- Numbers whose base-4 representation has exactly 7 runs.at n=5A043598
- Numbers k such that number of runs in the base 4 representation of k is congruent to 1 mod 6.at n=23A043838
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 7.at n=5A043843
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 8.at n=5A043857
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 9.at n=5A043865
- Numbers k such that the number of runs in the base-4 representation of k is congruent to 7 (mod 10).at n=5A043874
- Numerators of b(n) = (1/16^n)*(4/(8*n+1) - 2/(8*n+4) - 1/(8*n+5) - 1/(8*n+6)).at n=25A048581
- a(n) = T(n,n-4), array T as in A055807.at n=25A055809
- Coefficients in the series (1 + x - x^4 - x^6 - x^8 - x^9 - x^10 - x^12 - x^14 ...)/(1 - x^2 - x^3 - x^5 - x^7 - x^11 - x^13 ...).at n=24A058354
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 79 ).at n=17A063352
- Numbers k such that 10*k-1, 10*k-3, 10*k-7 and 10*k-9 are all prime.at n=23A064975
- Numbers n such that sigma (phi ( n ) ) = sigma (sigma (n ) ) where phi is Euler's totient and sigma is the multiplicative sum-of-divisors function.at n=5A065556
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=12A067355
- Smallest multiple of the n-th prime such that the n-th partial sum is divisible by n.at n=35A074105