7197
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9600
- Proper Divisor Sum (Aliquot Sum)
- 2403
- 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
- 4796
- Möbius Function
- 1
- Radical
- 7197
- 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
- 70
- 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 the continued fraction for sqrt(k) has period 60.at n=34A020399
- Fibonacci sequence beginning 5, 16.at n=14A022140
- a(n) = [ 2nd elementary symmetric function of {log(k)} ], k = 2,3,...,n.at n=40A025202
- Number of distinct products ijk with 0 <= i,j,k <= n.at n=49A027426
- 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 56.at n=22A031554
- Numbers k such that 219*2^k+1 is prime.at n=31A032486
- Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.at n=22A048130
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 24.at n=31A051965
- Matrix square of triangle A107876; equals matrix product of triangles: A107876^2 = A107862^-1*A107870 = A107867^-1*A107873.at n=29A107880
- Column 1 of triangle A107880.at n=6A107882
- a(n) = 8*n^2 - 3.at n=29A108928
- n+prime(n)+prime(prime(n)) is a triangular number, where prime(n) is the n-th prime.at n=13A116010
- Matrix inverse of triangle A122175, where A122175(n,k) = C( k*(k+1)/2 + n-k, n-k) for n>=k>=0.at n=29A121435
- Smallest number whose seventh power has at least n digits.at n=27A130081
- Triangle of 2-Eulerian numbers.at n=25A144696
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (0, 1), (1, -1), (1, 1)}.at n=10A151398
- Triangle T(n,m) read by rows: T(n,m) = ( Eulerian(n,m) - Binomial(n,m)^2 )/2, n >= 4, 2 <= m = <= n-1.at n=16A154353
- Triangle T(n,m) read by rows: T(n,m) = ( Eulerian(n,m) - Binomial(n,m)^2 )/2, n >= 4, 2 <= m = <= n-1.at n=17A154353
- Partial sums of A004080.at n=8A194541
- a(n) = 9*n^2 - 13*n + 5.at n=28A214675