3722
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5586
- Proper Divisor Sum (Aliquot Sum)
- 1864
- 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
- 1860
- Möbius Function
- 1
- Radical
- 3722
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T1 for Zeolite Code TON.at n=38A008241
- Expansion of Jacobi theta constant theta_2^6 /(64q^(3/2)).at n=45A008440
- Coordination sequence T1 for Zeolite Code VSV.at n=39A009914
- Coordination sequence T3 for Zeolite Code VSV.at n=40A009916
- Partial sums of A001935; at one time this was conjectured to agree with A007478.at n=28A014605
- Coordination sequence T3 for Zeolite Code OSI.at n=40A016432
- Number of integer points (x,y,z) at distance <= 0.5 from sphere of radius n.at n=17A016728
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=33A024834
- Number of partitions of n into parts not of the form 17k, 17k+7 or 17k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=29A035968
- Conjecturally, a power of 2 written in base 3 cannot have this many 2's.at n=27A036463
- Numbers n such that string 2,2 occurs in the base 10 representation of n but not of n-1.at n=37A044354
- Numbers n such that string 2,2 occurs in the base 10 representation of n but not of n+1.at n=37A044735
- Bessel function J_0(n) is a monotonically decreasing positive sequence.at n=14A046960
- Bessel function |J_0(n)| is a monotonically decreasing positive sequence.at n=25A046962
- Sum_{d|n, d=1 mod 4} d^2.at n=60A050450
- The array in A059216 read by antidiagonals in 'up' direction.at n=43A059217
- The array in A059216 read by antidiagonals in the direction in which it was constructed.at n=37A059234
- a(n) = prime(n)^2 + 1.at n=17A066872
- Centered square numbers: a(n) = 4*n^2 + 4*n + 2.at n=30A069894
- a(0)=1, then the fractional part of Pi*a(n) decreases monotonically to zero.at n=47A079043