6961
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6962
- 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
- 6960
- Möbius Function
- -1
- Radical
- 6961
- 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
- 57
- 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
- 894
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n+1) = n*a(n) + a(n-1) with a(0)=1, a(1)=0.at n=8A001053
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/6.at n=45A001136
- Related to 3-line Latin rectangles.at n=6A001568
- Primes that remain prime through 3 iterations of function f(x) = 9x + 4.at n=19A023297
- Primes that remain prime through 4 iterations of function f(x) = 9x + 4.at n=8A023325
- Greatest prime divisor of prime(n)*prime(n-1) + 1.at n=51A023525
- Least odd prime divisor of p(n)*p(n-1) + 1, or 1 if p(n)*p(n-1) + 1 is a power of 2.at n=51A023527
- Smallest prime containing n-th square as substring.at n=31A029948
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 50 ones.at n=18A031818
- Base 5 digits are, in order, the first n terms of the periodic sequence with initial period 2,1,0,3.at n=5A037731
- Primes p such that both p-2 and 2p-1 are prime.at n=41A038869
- Numerators of continued fraction convergents to sqrt(870).at n=3A042680
- Denominators of continued fraction convergents to sqrt(934).at n=9A042807
- Primes base 10 that remain primes in five bases b, 2<=b<=10, expansions interpreted as decimal numbers.at n=26A052029
- Successive rows of a triangle, the columns of which are generalized Fibonacci sequences S(j).at n=55A058294
- Successive rows of a triangle, the columns of which are generalized Fibonacci sequences S(j).at n=57A058294
- Primes p such that x^29 = 2 has no solution mod p.at n=27A059256
- Primes with 13 as smallest positive primitive root.at n=16A061326
- Triangle with a(n,n)=1, a(n,k)=(n-1)*a(n-1,k)+a(n-2,k) for n>k.at n=38A062323
- Triangle with a(n,n)=1, a(n,k)=(n-1)*a(n-1,k)+a(n-2,k) for n>k.at n=36A062323