3767
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3768
- 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
- 3766
- Möbius Function
- -1
- Radical
- 3767
- 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
- 87
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 524
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest number of complexity n: smallest number requiring n 1's to build using + and *.at n=27A005520
- Coordination sequence T2 for Zeolite Code MTT.at n=38A008190
- Numbers k such that the continued fraction for sqrt(k) has period 48.at n=29A020387
- Let q_k=p(p+2) be product of k-th pair of twin primes; sequence gives values of p such that (q_k)^2 > q_{k-i}q_{k+i} for all 1 <= i <= k-1.at n=31A021005
- Primes that remain prime through 2 iterations of function f(x) = 2x + 3.at n=47A023242
- Number of composite labeled topologies on n points.at n=4A028847
- Primes p whose digits do not appear in p^2.at n=43A030086
- 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 61.at n=3A031559
- Numbers k such that 101*2^k+1 is prime.at n=21A032400
- Primes of form x^2+62*y^2.at n=30A033240
- Integers n such that A047988(n)=3.at n=17A047986
- 4th term in Euclid-Mullin prime sequence started with n-th prime (cf. A000945).at n=56A051614
- McKay-Thompson series of class 21C for the Monster group.at n=18A058565
- Numbers m such that 5^m reversed is a prime.at n=10A058993
- Primes p such that p^9 reversed is also prime.at n=20A059702
- Number of n-feedback edge set obstructions.at n=5A060017
- a(1) = 1; a(n) = sum of terms in the continued fraction for the square of the continued fraction [a(1); a(2), a(3), a(4),..., a(n-1)].at n=42A061143
- Minimum positive value of lcm{1,...,n}*(s_1/1 + ... + s_n/n), where each s_i equals 1 or -1.at n=20A061194
- Minimum positive value of lcm{1,...,n}*(s_1/1 + ... + s_n/n), where each s_i equals 1 or -1.at n=19A061194
- Minimum positive value of lcm{1,...,n}*(s_1/1 + ... + s_n/n), where each s_i equals 1 or -1.at n=18A061194