6101
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6102
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 6100
- Möbius Function
- -1
- Radical
- 6101
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 111
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 796
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=38A001583
- Numbers n such that n, 2n+1, and 4n+3 all prime.at n=32A007700
- Numbers k such that the continued fraction for sqrt(k) has period 77.at n=2A020416
- Primes that remain prime through 3 iterations of function f(x) = 3x + 8.at n=7A023279
- Primes that remain prime through 3 iterations of function f(x) = 9x + 10.at n=25A023299
- Primes that remain prime through 4 iterations of function f(x) = 9x + 10.at n=9A023327
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=25A024848
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 6.at n=21A031419
- Numerators of continued fraction convergents to sqrt(241).at n=6A041450
- Primes with first digit 6.at n=30A045712
- T(n,n), array T as in A047030.at n=8A047032
- Sequence of 2 Pythagorean triangles, each with a leg and hypotenuse prime. The leg of the second triangle is the hypotenuse of the first.at n=24A048270
- Primes that yield a different prime when rotated by 180 degrees.at n=20A048890
- Automorphic primes: p such that p^p ends with the digits of p.at n=42A052228
- Least prime in A031930 (lesser of 12-twins) whose distance to the next 12-twin is 2*n.at n=19A052355
- Primes p whose period of reciprocal equals (p-1)/5.at n=13A056210
- The primes in A045574.at n=40A057770
- Primes p such that x^61 = 2 has no solution mod p.at n=13A059230
- Initial primes of Cunningham chains of first type with length exactly 3. Primes in A059453 that survive as primes just two "2p+1 iterations", forming chains of exactly 3 terms.at n=16A059762
- Primes whose sum of digits is 8.at n=27A062343