13197
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 4947
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8528
- Möbius Function
- -1
- Radical
- 13197
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 32
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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 n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n.at n=33A063048
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k.at n=34A088753
- Numbers k such that (10^(2*k+1) + 36*10^k - 1)/9 is prime.at n=10A107125
- Integers whose binary digits "1" define, if sorted into a quadrant shape whose right angle lies in a Go board corner, same colored Go stones that surely live all, but not if any stone is omitted.at n=26A166537
- Number of n X 5 nonnegative integer arrays with each row and column increasing from zero by 0 or 1.at n=6A202753
- Number of nX7 nonnegative integer arrays with each row and column increasing from zero by 0 or 1.at n=4A202755
- T(n,k)=Number of nXk nonnegative integer arrays with each row and column increasing from zero by 0 or 1.at n=59A202756
- T(n,k)=Number of nXk nonnegative integer arrays with each row and column increasing from zero by 0 or 1.at n=61A202756
- Number of 3 X n 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=33A229446
- Number of length 3 0..n arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=25A244906
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome and does not join the trajectory or one of the reverse numbers of the trajectory of any term m < k.at n=32A306232
- Dirichlet g.f.: zeta(s-3)^2 * (1 - 2^(4-s)) / zeta(s).at n=14A369101
- a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} gcd(x_1, x_2, x_3, n)^3.at n=14A372928