6761
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6762
- 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
- 6760
- Möbius Function
- -1
- Radical
- 6761
- 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
- 88
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 870
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/4.at n=40A001134
- a(n) = floor(n*phi^12), where phi is the golden ratio, A001622.at n=21A004927
- List of pairs of primes in reverse order, starting at 1.at n=9A007796
- Numbers k such that the continued fraction for sqrt(k) has period 53.at n=11A020392
- Primes that remain prime through 2 iterations of the function f(x) = 5x + 4.at n=41A023253
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A014306.at n=37A024467
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A014306.at n=36A025087
- Smallest prime containing n-th square as substring.at n=26A029948
- Palindromic primes in base 4.at n=24A029972
- Palindromic primes in base 8.at n=24A029976
- Smallest nontrivial extension of n-th square which is a prime.at n=25A030685
- 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 8.at n=11A031421
- Start of a string of exactly 3 consecutive (but disjoint) pairs of twin primes.at n=5A035791
- Positive numbers having the same set of digits in base 5 and base 9.at n=43A037432
- Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,2.at n=6A037545
- Numerators of continued fraction convergents to sqrt(345).at n=9A041652
- Numbers whose base-4 representation contains exactly three 1's and four 2's.at n=11A045104
- Primes for which only two iterations of 'Prime plus its digit sum equals a prime' are possible.at n=35A048524
- First of four consecutive primes that comprise two sets of twin primes.at n=28A053778
- Palindromic primes in bases 4 and 8.at n=5A056146