3768
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 9480
- Proper Divisor Sum (Aliquot Sum)
- 5712
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1248
- Möbius Function
- 0
- Radical
- 942
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 131
- 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 partitions of 4n-1 into n nonnegative integers each no greater than 8.at n=12A001982
- Related to representation as sums of squares.at n=31A002292
- Coordination sequence T3 for Zeolite Code MFS.at n=38A008175
- Number of partitions of n into prime power parts (1 excluded).at n=45A023894
- Numbers k such that the continued fraction for sqrt(k) has even period 2*m and the m-th term of the periodic part is 9.at n=38A031412
- Every run of digits of n in base 5 has length 2.at n=22A033003
- Coordination sequence T1 for Zeolite Code CFI.at n=40A033599
- Number of partitions satisfying (cn(0,5) <= cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=44A036813
- Triangular array read by rows: a(n,k) = Sum_{d|k} mu(d)*U(n,k/d)/n if k|n else 0, where U(n,k) = A047916(n,k) (1<=k<=n).at n=71A047919
- Numbers n such that 219*2^n-1 is prime.at n=8A050861
- Numbers n such that n | sigma_13(n).at n=13A055717
- Numbers n such that n*M127 + 1 is prime, where M127 = 2^127 - 1.at n=42A057440
- Multiples of 24 whose digits also sum to 24.at n=6A066270
- Smallest multiple of the n-th prime beginning with n.at n=36A078209
- a(n) = (9*n^2+3*n+1) * n!.at n=4A082036
- A square array of quadratic-factorial numbers, read by antidiagonals.at n=32A082038
- Number of triangular partitions of n of order 5.at n=10A084447
- a(n) = prime(n+2)^2 - prime(n)^2.at n=35A084856
- Sum of primitive roots of n-th prime.at n=36A088144
- Least multiple k of prime(n) such that (k-1,k+1) forms a twin prime pair, or 0 if no such number exists.at n=36A090530