3761
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3762
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 3760
- Möbius Function
- -1
- Radical
- 3761
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 38
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 523
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = 1000*log(n) rounded to the nearest integer.at n=42A004241
- Primes p == 1 (mod 8), p = a^2 +64*b^2 such that y^2 = x^3 + p*x has rank 0.at n=13A007765
- Coordination sequence T8 for Zeolite Code EUO.at n=38A008103
- Numbers k such that the continued fraction for sqrt(k) has period 53.at n=5A020392
- Primes that remain prime through 2 iterations of function f(x) = 6x + 1.at n=36A023256
- Primes that remain prime through 3 iterations of function f(x) = 10x + 9.at n=19A023301
- a(n) = position of n^2 + (n+1)^2 + (n+2)^2 in A000408.at n=37A024802
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 4.at n=29A031417
- Primes of form x^2+65*y^2.at n=25A033241
- Number of ordered rooted trees with n edges such that the rightmost leaf of each subtree is at even level. Equivalently, number of Dyck paths of semilength n with no return descents of odd length.at n=8A033297
- Number of partitions satisfying (cn(0,5) = cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=53A036824
- Schoenheim bound L_1(n,n-4,n-5).at n=21A036830
- Numerators of continued fraction convergents to sqrt(877).at n=8A042694
- Primes p such that p+6 and p+8 are also primes.at n=29A046138
- p, p+6 and p+8 are all primes (A046138) but p+2 is not.at n=19A049438
- a(n) is the first prime p from A031924 such that A052180(primepi(p)) = prime(n).at n=13A052229
- Primes for which some rearrangement of the digits (leading zeros not allowed) is the product of two consecutive primes.at n=26A053652
- Run through primes p; if the digits of p*q (where q is the prime following p) can be rearranged to form one or more primes r, append these primes r to the sequence.at n=17A053736
- Let prime(i) = i-th prime, let twin(n) = (P,Q) be n-th pair of twin primes; sequence gives prime(Q).at n=24A057473
- Number of labeled lattices with a fixed bottom and top.at n=5A058165