4439
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4656
- Proper Divisor Sum (Aliquot Sum)
- 217
- 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
- 4224
- Möbius Function
- 1
- Radical
- 4439
- 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
- 95
- 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 8 positive 6th powers.at n=46A003364
- Number of walks on cubic lattice.at n=22A005570
- Coordination sequence T1 for Zeolite Code MTN.at n=40A008186
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=11A020445
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (Lucas numbers).at n=13A024459
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (Lucas numbers).at n=12A025079
- Nonprime; becomes prime if any digit is deleted (zeros not allowed in the number).at n=48A034304
- Upper members of a "good pair" of the form (k, 2*k +- 1).at n=33A046862
- Coordination sequence T3 for Zeolite Code DON.at n=45A047955
- Number of n-bead necklace structures using a maximum of four different colored beads.at n=9A056292
- Numbers k such that A055079(k) = 2^k.at n=17A057838
- Integers n > 196 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 196.at n=32A063049
- Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.at n=21A064907
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k)-k*tau(k) where tau(k) = A000005(k) is the number of divisors of k.at n=33A067356
- Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=12A077405
- Smallest multiple of the n-th prime beginning with n.at n=43A078209
- Numbers k such that A049614(k) - A000040(k) is prime.at n=15A078745
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; a(n) is the number of distinct partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p<=A000230(n). Multiple occurrences of a partition are not counted.at n=38A079024
- a(n)=(-1)^n(1 - (1/12)n(n + 1)(12 - n + n^2)).at n=15A080275
- Arithmetic means of rows of A083173.at n=43A083176