3759
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 2001
- 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
- 2136
- Möbius Function
- -1
- Radical
- 3759
- 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
- 87
- 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
- Number of ways to pair up {1..2n} so sum of each pair is prime.at n=8A000341
- Coordination sequence T2 for Zeolite Code GOO.at n=42A008112
- Coordination sequence T1 for Zeolite Code MFI.at n=39A008161
- a(0) = 1, a(n) = 13*n^2 + 2 for n>0.at n=17A010004
- a(n) = n*(17*n + 1)/2.at n=21A022275
- a(n) = position of 3*(n^2) in A000408.at n=38A024800
- 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 19.at n=26A031517
- Triangle read by rows giving T(n,k) = number of inequivalent indecomposable linear [ n,k ] binary codes without 0 columns (n >= 2, 1 <= k <= n).at n=60A034254
- Number of indecomposable binary [ n,6 ] codes without 0 columns.at n=11A034353
- Numbers whose base-4 representation contains exactly three 2's and three 3's.at n=10A045151
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=26A049779
- Number of nonnegative integer 3 X 3 matrices with sum of elements equal to n, under row and column permutations.at n=12A052365
- Number of step cyclic shifted sequence structures using exactly two different symbols.at n=19A056434
- Sum of squares of first n quarter-squares (A002620).at n=12A059859
- a(1) = 2, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).at n=7A062094
- Composites for which the row of the prime-composite array (A063173) includes the leftmost element of both a zero-only antidiagonal and a zero-only diagonal(A067681).at n=27A063176
- Numbers n such that 2^n + n^2 is prime.at n=8A064539
- Limit of A069258(k,n) = number of partitions of 2*k into k-n prime parts, as k tends to infinity.at n=32A069259
- Arithmetic means of rows of A083173.at n=40A083176
- Odd-digit products of three odd-digit primes p*q*r.at n=46A107077