6943
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7128
- Proper Divisor Sum (Aliquot Sum)
- 185
- 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
- 6943
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 256
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Odd heptagonal numbers (A000566).at n=26A014637
- Pseudoprimes to base 24.at n=26A020152
- Pseudoprimes to base 47.at n=45A020175
- Pseudoprimes to base 52.at n=26A020180
- Pseudoprimes to base 60.at n=21A020188
- Pseudoprimes to base 63.at n=23A020191
- Pseudoprimes to base 69.at n=29A020197
- Strong pseudoprimes to base 63.at n=14A020289
- Strong pseudoprimes to base 99.at n=12A020325
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 22 (most significant digit on left).at n=14A029491
- a(n) = (2*n + 1)*(5*n + 1).at n=26A033571
- Denominators of continued fraction convergents to sqrt(561).at n=11A042075
- Border sum triangle, read by rows: Let T(n,0)=T(n,n)=1. In general T(n,m) is the sum of the elements (apart from T(n,m) itself) in the border of the rectangle with vertices T(0,0), T(n-m,0), T(n,m) and T(m,m).at n=61A063394
- Border sum triangle, read by rows: Let T(n,0)=T(n,n)=1. In general T(n,m) is the sum of the elements (apart from T(n,m) itself) in the border of the rectangle with vertices T(0,0), T(n-m,0), T(n,m) and T(m,m).at n=59A063394
- T(4,n) with T(n,m) as in A063394.at n=6A063397
- a(n) = (9*n^2 + 5*n + 2)/2.at n=39A064225
- Numerators of partial sums of 1/A051451.at n=8A064888
- Smallest number which requires n^2 steps in the 3x+1 problem.at n=16A066773
- An auxiliary bit-mask sequence for computing A066425. (The "dirty", unsymmetric one).at n=3A068222
- a(n) = A077347(n)^(1/2).at n=47A077349