3872
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 8379
- Proper Divisor Sum (Aliquot Sum)
- 4507
- 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
- 1760
- Möbius Function
- 0
- Radical
- 22
- Omega Function (Ω)
- 7
- 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
- 100
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- a(n) = 2*n^2.at n=44A001105
- Numbers of the form 2^i * 11^j.at n=28A003596
- a(n) = floor(phi*a(n-1)) + a(n-2) where phi is the golden ratio.at n=11A005830
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=40A007077
- Coordination sequence T2 for Zeolite Code EDI.at n=44A008085
- Coordination sequence T7 for Zeolite Code MEL.at n=40A008156
- Number of partitions of n into parts >= 3.at n=45A008483
- Fibonacci sequence beginning 1, 16.at n=13A022106
- Number of partitions of n in which the least part is 3.at n=48A026796
- Expansion of (theta_3(z)*theta_3(15z) + theta_2(z)*theta_2(15z))^3.at n=45A028627
- Product of n with 666 is palindromic.at n=30A030094
- a(n) = floor(n^3 / Pi).at n=23A032633
- Numbers k such that sigma(phi(k)) = phi(sigma(k)).at n=6A033632
- Numbers whose prime factors are 2 and 11.at n=13A033848
- Coordination sequence for 44-dimensional cubic lattice.at n=2A035739
- Coordination sequence for C_44 lattice.at n=1A035781
- Coordination sequence for lattice D*_44 (with edges defined by l_1 norm = 1).at n=2A035807
- Coordination sequence for diamond structure D^+_44. (Edges defined by l_1 norm = 1.)at n=2A035898
- Composite numbers k such that the digits of the prime factors of k are either 1 or 2.at n=30A036302
- Composite numbers n such that juxtaposition of prime factors of n has length 9.at n=24A036333