4490
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8100
- Proper Divisor Sum (Aliquot Sum)
- 3610
- 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
- 1792
- Möbius Function
- -1
- Radical
- 4490
- 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
- 46
- Smith Number
- no
- Vampire 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
- yes
- Odd
- no
Appears in sequences
- a(n) = a(n-2) + a(n-3) + a(n-4), with initial values a(0) = 0, a(1) = 2, a(2) = 3, a(3) = 6.at n=21A001634
- Number of integers with a shortest addition chain of length n.at n=16A003065
- Coordination sequence for MgCu2, Cu position.at n=17A009930
- "DHK[ n ](2n)" (bracelet, identity, unlabeled, n parts, evaluated at 2n) transform of 1,1,1,1,...at n=9A032250
- Numerators of continued fraction convergents to sqrt(499).at n=5A041952
- Values of n^2 + 1 resulting from A050796.at n=36A050800
- Numbers k such that k | sigma_7(k).at n=31A055711
- Numbers k such that the first k base-4 digits of Pi expressed in decimal forms a prime.at n=3A065991
- a(n) = prime(n)^2 + 1.at n=18A066872
- Number of prime alternating tangles (or knots) with two connected components.at n=8A067646
- Centered square numbers: a(n) = 4*n^2 + 4*n + 2.at n=33A069894
- Numbers k such that prime(k) + prime(k+1) + prime(k+2) is a square.at n=13A076305
- Numbers k such that (k-1)*binomial(2k,k) + 1 is prime.at n=42A085793
- Prime(prime(n))^2+1.at n=7A092774
- a(n) = A056188(n)/n.at n=17A098792
- Bisection of A001157: a(n) = sigma_2(2n-1).at n=33A099978
- Number of score vectors for tournaments on n nodes that do not determine the tournament uniquely.at n=10A121244
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has an integer solution, n is a term in the sequence.at n=31A125754
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has a positive integer solution, n is a term in the sequence.at n=17A125756
- Partial sum of irregular primes A000928.at n=19A132360