3785
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4548
- Proper Divisor Sum (Aliquot Sum)
- 763
- 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
- 3024
- Möbius Function
- 1
- Radical
- 3785
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 131
- 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
- Centered square numbers: a(n) = 2*n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z=Y+1) ordered by increasing Z; then sequence gives Z values.at n=43A001844
- Number of simple tournaments with n nodes.at n=7A003505
- Coordination sequence T6 for Zeolite Code BOG.at n=44A008054
- Sum along upward diagonal of Pascal triangle from (but not including) center.at n=22A010756
- Sum along upward diagonal of Pascal triangle from center.at n=22A010757
- Number of ordered quadruples of integers from [ 1,n ] with no common factors between pairs.at n=28A015636
- Pseudoprimes to base 87.at n=26A020215
- Strong pseudoprimes to base 87.at n=7A020313
- Numbers k such that the continued fraction for sqrt(k) has period 17.at n=22A020356
- a(n) = T(n, 2*n-6), T given by A027926.at n=11A027929
- a(n) = T(2*n, n+4), T given by A027935.at n=3A027940
- Composite numbers whose prime factors contain no digits other than 5 and 7.at n=15A036320
- G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 17 generated by (1,2,...,17).at n=6A036731
- In ternary expansion of n, reading from left to right, digits occur in order ...,0,1,2,0,1,2,...at n=15A037079
- Base-3 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,0.at n=7A037504
- Odd numbers with exactly 2 distinct palindromic prime factors.at n=46A046404
- a(n)=T(n,n+1), array T as in A049723.at n=34A049729
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 15.at n=6A051980
- Partial sums of A053296.at n=6A053308
- a(n) = T(n,n-6), array T as in A055801.at n=23A055806