6106
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9504
- Proper Divisor Sum (Aliquot Sum)
- 3398
- 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
- 2940
- Möbius Function
- -1
- Radical
- 6106
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 155
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of (unordered) triples of integers from [1,n] with no common factors between pairs.at n=49A015617
- Numbers k such that phi(k + 12) | sigma(k) for k not congruent to 0 (mod 3).at n=25A015850
- Numbers k such that the continued fraction for sqrt(k) has period 82.at n=10A020421
- Exactly half of first a(n) terms of A022300 are 1's (not known to be infinite).at n=17A025513
- Numbers whose set of base-14 digits is {2,3}.at n=18A032814
- Numbers m such that 2*phi(m) = phi(m+1).at n=12A050472
- Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives k values.at n=6A053019
- a(n) = 4*a(n-1) - a(n-2) + 3 with a(0)=1, a(1)=7.at n=6A055269
- McKay-Thompson series of class 15A for Monster.at n=14A058508
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 14.at n=11A066696
- Numbers n such that n and the n-th prime have the same digits.at n=7A074350
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1, a(n+1)>a(n) and x=5/4.at n=33A080198
- a(n) = (9*n^2 - 3*n + 2)/2.at n=37A080855
- a(n) = floor(r^n) where r is the smallest Pisot number (real root r=1.3247179... of x^3-x-1).at n=31A112639
- Let T(S,Q) be the sequence obtaining by starting with S and repeatedly reversing the digits and adding Q to get the next term. This is T(1016,5), the first S for which T(S,5) reaches a cycle of length 36.at n=1A118879
- Let T(S,Q) be the sequence obtaining by starting with S and repeatedly reversing the digits and adding Q to get the next term. This is T(1016,5), the first S for which T(S,5) reaches a cycle of length 36.at n=37A118879
- a(n) = sum of n successive primes after the n-th prime.at n=29A131740
- Triangle, read by rows of 2n+1 terms, where T(n,k) = T(n,k-1) + T(n-1,k-1) for 2n>=k>0, T(n,2n-1) = T(n,2n-2) + T(n-1,n-1) and T(n,2n) = T(n,2n-1) + T(n-1,n-1) for n>0, with T(n,0) = T(n-1,n-1) for n>0 and T(0,0) = 1.at n=43A132289
- McKay-Thompson series of class 15A for the Monster group with a(0) = 1.at n=14A134783
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (0, 1, -1), (1, 0, 0), (1, 1, 0)}.at n=7A150345