7967
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8256
- Proper Divisor Sum (Aliquot Sum)
- 289
- 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
- 7680
- Möbius Function
- 1
- Radical
- 7967
- 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
- 96
- 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
- Numbers k such that 9*2^k + 1 is prime.at n=34A002256
- G.f.: (1 + x^4 + x^7 + 2*x^8 + x^9 + x^12 + x^16)/Product_{i=1..8} (1 - x^i).at n=31A003405
- Number of walks on cubic lattice.at n=30A005570
- G.f.: Product_{k>=1} (1 + x^(2*k - 1)) / (1 - x^(2*k)).at n=43A006950
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=27A024972
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...).at n=13A025105
- Least k such that first k terms of A022303 contain n more 2's than 1's.at n=10A025518
- Sequence satisfies T^2(a)=a, where T is defined below.at n=52A027596
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 89.at n=5A031587
- Numbers k such that 105*2^k+1 is prime.at n=35A032402
- Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=3A045277
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=13A049970
- Numbers which, when expressed as a sum of distinct primes with maximum product, use a non-maximal number of primes.at n=31A053020
- Numbers k such that 5*2^k + 3 is prime.at n=45A058586
- McKay-Thompson series of class 45A for Monster.at n=51A058684
- Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.at n=42A064907
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals 3n.at n=38A070899
- a(n) = number of m such that A080737(m) <= 2n.at n=36A080740
- {a(n)} is monotone increasing, with a(1)=1, a(2)=3 and, for n>2, a(n) is the smallest integer such that a(n) mod a(j) is never a(i) for any pair i,j with 1<=i<j<n.at n=41A100812
- Numbers whose binary representation is the concatenation of 2n-1 digits 1, n digits 0 and 2n-1 digits 1.at n=2A147540