3763
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3888
- Proper Divisor Sum (Aliquot Sum)
- 125
- 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
- 3640
- Möbius Function
- 1
- Radical
- 3763
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 38
- 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
- Coefficients of modular function G_4(tau).at n=24A005762
- Number of symmetric polynomial functions of degree n of a symmetric matrix (of indefinitely large size) under joint row and column permutations. Also number of multigraphs with n edges (allowing loops) on an infinite set of nodes.at n=7A007717
- Coordination sequence T4 for Zeolite Code NON.at n=37A008215
- Coordination sequence T3 for Zeolite Code -ROG.at n=46A009861
- Coordination sequence T3 for Zeolite Code ZON.at n=43A009921
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 19 ones.at n=1A031787
- a(n) = (3*n - 1)*(4*n - 1).at n=18A033578
- Least inverse of A015910: smallest integer k > 0 such that 2^k mod k = n, or 0 if no such k exists.at n=12A036236
- Largest squarefree number k such that Q(sqrt(-k)) has class number n.at n=5A038552
- a(n)=(s(n)+1)/8, where s(n)=n-th base 8 palindrome that starts with 7.at n=40A043071
- Discriminants of imaginary quadratic fields with class number 6 (negated).at n=50A046003
- Nonprime numbers k such that sum of aliquot divisors of k is a cube.at n=25A048698
- Starting positions of strings of 2 8's in the decimal expansion of Pi.at n=31A050263
- Number of trees T of order n such that W(T) = W(L(L(T))) where W(G) and L(G) are the Wiener index and line graph of a graph G.at n=24A051175
- Integers n > 196 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 196.at n=25A063049
- Numbers k such that phi(sigma(k^3)) is a square.at n=45A063796
- Centered 22-gonal numbers.at n=18A069173
- Smallest argument m such that commutator[phi(m), gpf(m)] = 2n-1, where phi(m) = A000010(m) and gpf(m) = A006530(m), the largest prime factor of m.at n=28A070818
- Positions of check bits in code in A075931.at n=39A075933
- Greatest number, not divisible by 4, having exactly n partitions into three squares.at n=2A095811