4965
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7968
- Proper Divisor Sum (Aliquot Sum)
- 3003
- 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
- 2640
- Möbius Function
- -1
- Radical
- 4965
- 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
- 41
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n^3 + 3*n + 1.at n=17A005491
- Numbers k such that the continued fraction for sqrt(k) has period 46.at n=38A020385
- a(n) = n*(11*n+1)/2.at n=30A022269
- Duplicate of A022269.at n=29A026817
- Numbers k that divide 10^k + 5^k.at n=48A045599
- Number of divisors of n! which are also differences between consecutive divisors of n! (ordered by size).at n=18A060742
- Position of first repeat of the opening sequence of length n occurring after the first repeat of the opening sequence of length n-1 in the Kolakoski sequence (A000002).at n=24A074300
- a(n) = (n-1)*(n-2)^3 - A003878(n-3), with a(1) = a(2) = 0 and a(3) = 2.at n=19A075681
- a(n) = 4*n^2 + 10*n + 1.at n=34A082112
- Numbers n such that the Zsigmondy number Zs(n,4,1) differs from the n-th cyclotomic polynomial evaluated at 4.at n=48A093108
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 3, s(2n+1) = 4.at n=7A094832
- Number of permutations of length n which avoid the patterns 213, 1234, 4312.at n=43A116720
- Numbers k such that k^2 divides 16^k-1.at n=35A128396
- Similar to A072921 but starting with 3.at n=29A152232
- Numbers of the form p*q*r, where p < q < r are odd primes such that r = +/-1 (mod p*q).at n=25A160353
- Convolved with its aerated variant of two zeros between terms = A000041.at n=37A174068
- a(n) = 5*(10^n-7).at n=2A177080
- Least positive integer m > 1 such that 1 - m^k + m^(2k) - m^(3k) + m^(4k) is prime, where k = A003592(n).at n=32A181980
- Let i be in {1,2,3,4} and r>=0 an integer. Let p ={p_1,p_2,p_3,p_4} = {-3,0,1,2}, n=3*r+p_i and define a(-3)=0. Then a(n)=a(3*r+p_i) gives the number of H_(9,3,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(2*cos(Pi/9)).at n=47A187497
- Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p={p_1, p_2, p_3, p_4} = {-3,0,1,2}, n=3*r+p_i, and define a(-3)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,4,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(2*cos(Pi/9)).at n=46A187498