7969
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8596
- Proper Divisor Sum (Aliquot Sum)
- 627
- 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
- 7344
- Möbius Function
- 1
- Radical
- 7969
- 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
- 52
- 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
- Oscillates under partition transform.at n=52A007213
- Numbers k for which 10k+1, 10k+3, 10k+7 and 10k+9 are primes.at n=31A007811
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/32 ).at n=24A011942
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=18A015992
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MAZ = Mazzite (Na2,K2,Ca,Mg)5[Al10Si26O72].28H2O starting from a T1 atom.at n=12A019142
- Pseudoprimes to base 35.at n=24A020163
- Pseudoprimes to base 66.at n=26A020194
- Numbers k such that the continued fraction for sqrt(k) has period 63.at n=13A020402
- Numerators of continued fraction convergents to sqrt(133).at n=8A041242
- Numbers k such that k^2 is composed of three 1-digit-overlapping subsquares.at n=7A048426
- Expansion of (1+2*x+3*x^2)/((1-x)^3*(1-x^2)).at n=24A055232
- Expansion of (3+10*x+3*x^2)/(1-x)^12.at n=4A059624
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=17A065216
- Reflective numbers: k such that the decimal encoding of the prime factorization of k (A067599) is palindromic.at n=40A066985
- Least k such that Sum_{i=1..k} (prime(i) + prime(i+2) - 2*prime(i+1)) = 2n + 1.at n=22A073051
- Numbers k such that k + sum_of_digits(k) is a cube.at n=17A084661
- Scale factor by which primitive Pythagorean triangle {x=A088509(n), y=A088510(n), z=A088511(n)} needs be enlarged in order to circumscribe the smallest integral square having a side on the hypotenuse.at n=13A088544
- Triangular array: T(n,k) = T(n,n) = 1, T(n,k) = 5*T(n-1, k-1) + 2*T(n-1, k), read by rows.at n=25A119727
- a(n) = 8*n^2 - 7*n + 1.at n=32A125201
- Odd composite numbers m for which 12*|A000367((m+1)/2)|==(-1)^{(m-1)/ 2}* A002445((m+1)/2) (mod m).at n=41A180943