6973
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
- 4
- Divisor Sum
- 7360
- Proper Divisor Sum (Aliquot Sum)
- 387
- 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
- 6588
- Möbius Function
- 1
- Radical
- 6973
- 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
- 181
- 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
- Number of paraffins.at n=24A006001
- a(n) = a(n-1) + a(n - 1 - number of even terms so far).at n=39A006336
- Numerator of the coefficient [x^(2n)] in the Taylor series sec(cosec(x) - cosech(x)).at n=4A013535
- Pseudoprimes to base 84.at n=19A020212
- Strong pseudoprimes to base 83.at n=9A020309
- Strong pseudoprimes to base 84.at n=5A020310
- Numbers k such that the continued fraction for sqrt(k) has period 90.at n=10A020429
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=45A024834
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=43A024843
- a(n) = Sum_{k=m..n} T(k,n-k), where m = floor((n+1)/2); a(n) is the n-th diagonal-sum of left justified array T given by A027948.at n=22A027959
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 46 ones.at n=22A031814
- Number of partitions in parts not of the form 13k, 13k+1 or 13k-1. Also number of partitions with no part of size 1 and differences between parts at distance 5 are greater than 1.at n=42A035949
- Number of partitions with at most one part divisible by 5.at n=31A039905
- a(1) = 5; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=43A046255
- a(n) = 4*n^2 - 10*n + 7.at n=42A054554
- a(n) = p^2 + p + 1 where p runs through the primes.at n=22A060800
- Numbers that are sums of divisors of the odd squares; Intersection of A065764 and A065766, written in ascending order and duplicates removed.at n=37A065768
- a(0)=0, a(1)=1, a(2)=1, a(3)=1, a(n) = a(n-3) + a(n-4) for n > 3.at n=47A079398
- Numbers of the form 1+(1+p)*p^e, p prime and e>0.at n=44A087195
- Number of hyperplanes in a finite projective space (of some dimension d over some finite field of order q).at n=61A090503