6107
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6336
- Proper Divisor Sum (Aliquot Sum)
- 229
- 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
- 5880
- Möbius Function
- 1
- Radical
- 6107
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 155
- 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
- no
- Odd
- yes
Appears in sequences
- Perrin sequence (or Perrin numbers, or Ondrej Such sequence): a(n) = a(n-2) + a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2.at n=31A001608
- Patterns in a dual ring.at n=13A007574
- Coordination sequence T1 for Zeolite Code NON.at n=47A008212
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=19A020445
- Numbers whose set of base-14 digits is {2,3}.at n=19A032814
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=21A064909
- a(1) = 1; thereafter a(n) is the smallest number > a(n-1) such that a(n) minus any sum of distinct earlier terms is not already in the sequence.at n=11A066425
- Number of bargraphs of site-perimeter n.at n=18A075126
- Least nontrivial multiple of the n-th prime beginning with 6.at n=44A078290
- Nearest integer to Sum_{k=0..n} binomial(n,k)/2^(k*(k-1)/2).at n=45A079492
- Row sums of the triangle A105160.at n=11A105157
- a(n) = -a(n-1)+4*a(n-2)+4*a(n-3)-a(n-4)-a(n-5).at n=15A107401
- a(1)=2. For n >=2, a(n) = p(n) *(floor(a(n-1)/p(n)) +2), where p(n) is the n-th prime.at n=44A138621
- Row sums of a Collatz triangle.at n=46A138847
- a(n) = 4n^2 - 10n + 107.at n=40A161176
- Numbers n such that phi(n)=2*phi(n-1).at n=12A171271
- Number of 0..n arrays x(0..10) of 11 elements with zero 5th differences.at n=37A200373
- Concatenation of the decimal digits of Fibonacci(n) and the Fibonacci(n)-th digit of Pi.at n=15A201773
- Number of ways to place 6 nonattacking semi-queens on an n X n board.at n=6A202657
- a(n) = round(r^n) where r is the smallest Pisot number (real root r=1.3247179.. of x^3-x-1).at n=31A205579