3758
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
- 5640
- Proper Divisor Sum (Aliquot Sum)
- 1882
- 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
- 1878
- Möbius Function
- 1
- Radical
- 3758
- 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
- 87
- 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
- yes
- Odd
- no
Appears in sequences
- MacMahon's generalized sum of divisors function.at n=15A002128
- Coordination sequence T6 for Zeolite Code MFS.at n=38A008178
- Coordination sequence T4 for Zeolite Code TER.at n=41A016436
- The sequence m(n) in A022905.at n=35A022907
- Numbers k such that Hofstadter Q-sequence Q(k) (A005185) satisfies Q(k) = k/2.at n=43A027619
- 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 60.at n=14A031558
- Numbers whose set of base-12 digits is {1,2}.at n=27A032932
- Number of partitions satisfying cn(0,5) + cn(1,5) + cn(4,5) <= cn(2,5) and cn(0,5) + cn(1,5) + cn(4,5) <= cn(3,5).at n=41A039906
- Numbers having four 2's in base 6.at n=21A043380
- Numbers whose base-4 representation contains exactly four 2's and two 3's.at n=11A045155
- Numbers whose base-5 representation contains exactly two 0's and three 1's.at n=43A045168
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=42A050029
- Intersection of A068017 and A068019: numbers n such that both sigma(n) and phi(n) are middle terms between (different) twin prime pairs.at n=40A071348
- Numbers n such that A005185(n) divides n.at n=44A076267
- a(0) = 1, a(1)= 2, a(n) = (a(n+1) - a(n-1))/n, or a(n+1) = n*a(n) + a(n-1).at n=7A093858
- Triangle read by rows: T(n, k) = number of hill-free Dyck paths (i.e., no peaks at height 1) of semilength n and having k peaks.at n=51A100754
- Triangle read by rows: T(n, k) = number of hill-free Dyck paths (i.e., no peaks at height 1) of semilength n and having k peaks.at n=48A100754
- Diagonal sums of number triangle A104881.at n=14A104882
- Numbers in A055039 but not in A044075.at n=41A124169
- a(n) = 2*a(n-1) + prime(n) - prime(n-1), a(1)=2, where prime(n) denotes the n-th prime.at n=10A125180