3832
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7200
- Proper Divisor Sum (Aliquot Sum)
- 3368
- 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
- 1912
- Möbius Function
- 0
- Radical
- 958
- Omega Function (Ω)
- 4
- 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
- 56
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Number of 2-factors in W_5 X P_n.at n=2A003736
- Number of fixed n-celled polyominoes which need only touch at corners.at n=5A006770
- Coordination sequence T2 for Zeolite Code DDR.at n=39A008072
- Coordination sequence T2 for Zeolite Code LEV.at n=46A008128
- Coordination sequence T3 for Zeolite Code LTN.at n=43A008142
- Coordination sequence T5 for Zeolite Code RUT.at n=41A009901
- Partial sums of primes, if 1 is regarded as a prime (as it was until quite recently, see A008578).at n=44A014284
- Sum of gcd(x, y) for 1 <= x, y <= n.at n=38A018806
- Number of partitions of n that do not contain 4 as a part.at n=31A027338
- Theta series of 6-dimensional lattice P6.4 = A6,2.at n=20A029690
- Coordination sequence T14 for Zeolite Code STT.at n=41A038430
- a(n) = a(n-1) + a(m) for n >= 3, 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) = 1 and a(2) = 3.at n=36A050069
- Numbers k such that k^10 == 1 (mod 11^3).at n=27A056085
- Positive numbers whose product of digits is 9 times their sum.at n=20A062041
- Let s(k) denote the k-th term of an integer sequence such that s(0)=0 and s(i) for all i>0 is the least natural number such that no four elements of {s(0),..,s(i)} are in arithmetic progression. Then it appears that there are many set of 3 consecutive integers in s(k). Sequence gives the smallest element in those triples.at n=24A071711
- Number of primes between consecutive partition numbers.at n=52A086609
- a(n) = prime(a(n-1)) + abs(prime(n)-a(n-1)).at n=6A086912
- G.f. = (1 + 4 * g.f. for A096661)/(1 + 2 Sum_{m>=1} (-1)^m*q^(m^2)).at n=48A097042
- a(n) = (7*3^n + 2n + 5)/4.at n=7A103177
- Sophie Germain 4-almost primes.at n=40A111176