6184
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11610
- Proper Divisor Sum (Aliquot Sum)
- 5426
- 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
- 3088
- Möbius Function
- 0
- Radical
- 1546
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 124
- 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
- Numbers k such that 3^k - 2 is prime.at n=22A014224
- 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 39.at n=20A031537
- Trajectory of 1 under map n->43n+1 if n odd, n->n/2 if n even.at n=26A033977
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 5).at n=44A035566
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2 and 4 (mod 5).at n=51A035586
- Numbers having four 4's in base 6.at n=11A043388
- Numbers whose base-4 representation contains exactly three 0's and three 2's.at n=22A045055
- a(0)=4, a(1)=9, a(n) = 4a(n-1) - a(n-2).at n=6A057819
- a(n+1) = a(n)-th composite number, with a(1) = 11.at n=27A059407
- a(n) = Sum_{k=0..n} C(4*k,k)*C(4*(n-k),n-k).at n=4A078995
- a(1) = 1, a(2) = 2; then a(n) = smallest number such that there are a(n-1) composite numbers between a(n) and a(n+1) exclusive.at n=15A082281
- Number of partitions of the n-th minimal number into distinct minimal numbers.at n=28A099388
- Let pi be an unrestricted partition of n with the summands written in binary notation. a(n) is the number of such partitions whose binary representation has an odd number of binary ones.at n=34A102437
- 3*Volume of the root-n Waterman polyhedron of void-center type as defined in A119870.at n=33A119878
- Floor of sum of the first n^2 square roots.at n=21A138357
- Expansion of Product_{k > 0} (1 + A005229(k)*x^k).at n=22A147880
- a(j) = maximum value of n for each distinct increasing value of (Sum of the quadratic non-residues of prime(n) - Sum of the quadratic residues of prime(n)) / prime(n) for each j.at n=11A166263
- Number of increasing sequences of n integers x(1),...,x(n) with values in 1..3*n such that x(j) divides x(k) if j divides k.at n=15A180385
- Number of 3-step one or two space at a time bishop's tours on an n X n board summed over all starting positions.at n=12A187047
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210755; see the Formula section.at n=43A210756