4411
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4824
- Proper Divisor Sum (Aliquot Sum)
- 413
- 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
- 4000
- Möbius Function
- 1
- Radical
- 4411
- 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
- 46
- 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
- a(n) = a(n-1) - 2*a(n-2) with a(0) = 2, a(1) = 1.at n=25A002249
- Coordination sequence T2 for Zeolite Code APD.at n=44A008035
- Coordination sequence T2 for Zeolite Code MTN.at n=40A008187
- Coordination sequence T1 for Milarite.at n=41A008256
- Positive integers n such that 2^n == 2^11 (mod n).at n=54A015935
- Define sequence S(a_0,a_1) by a_{n+2} is least integer such that a_{n+2}/a_{n+1}>a_{n+1}/a_n for n >= 0. This is S(3,4).at n=14A018908
- Pseudoprimes to base 29.at n=30A020157
- Pseudoprimes to base 39.at n=15A020167
- Pseudoprimes to base 72.at n=21A020200
- Pseudoprimes to base 83.at n=38A020211
- Strong pseudoprimes to base 29.at n=7A020255
- Strong pseudoprimes to base 83.at n=8A020309
- Numbers k such that Fibonacci(k) == 89 (mod k).at n=46A023182
- Expansion of (1+x^2-x^3)/(1-x)^4.at n=27A027378
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 65.at n=14A031563
- Numbers whose set of base-10 digits is {1,4}.at n=26A032822
- Every run of digits of n in base 10 has length 2.at n=37A033008
- Decimal part of cube root of a(n) starts with 4: first term of runs.at n=15A034130
- a(n)=(s(n)+3)/9, where s(n)=n-th base 9 palindrome that starts with 6.at n=24A043077
- Numbers whose base-4 representation has exactly 7 runs.at n=26A043598