6793
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6794
- 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
- 6792
- Möbius Function
- -1
- Radical
- 6793
- 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
- 75
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 875
- 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=41A001134
- Primes p == 1 (mod 8), p = a^2 +64*b^2 such that y^2 = x^3 + p*x has rank 0.at n=31A007765
- Numbers k such that the continued fraction for sqrt(k) has period 71.at n=3A020410
- Least inverse of A001390, or 0 if no inverse exists.at n=22A020638
- Discriminants of quintic fields with 4 complex conjugates.at n=39A023685
- Boris Stechkin's function.at n=25A055004
- Initial prime in first sequence of n primes congruent to 3 modulo 5.at n=2A057631
- Primes p such that p^5 reversed is also prime.at n=44A059698
- Primes with 10 as smallest positive primitive root.at n=19A061323
- S[A002808(n)] where S[] is Boris Stechkin's function (A055004) and A002808(n) are the composites.at n=16A063483
- Twin primes belonging to packs of three or more twin pairs.at n=36A069467
- Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=23A077405
- Class 6- primes (for definition see A005109).at n=14A081425
- Add 1, multiply by 1, add 2, multiply by 2, etc.; start with 4.at n=13A082448
- Primes in which odd positioned digits are prime and even positioned digits are composite. The least significant digit is taken to be the first digit.at n=44A083820
- a(1)=2; for n>1 a(n) is the largest prime number m such that a(n-1)^(1/(n-1))>m^(1/n).at n=20A086566
- Beginning with 2, least new prime such that the concatenation a(n), a(n-1), ...a(2), a(1), a(2), ...a(n) is prime.at n=41A090564
- Primes with digit sum = 25.at n=28A106763
- Shadow of sqrt(2).at n=40A110557
- Table read by rows: rows give successive prime sextets of form k, k+30, k+60, k+90, k+120, k+150.at n=34A123085