13097
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14976
- Proper Divisor Sum (Aliquot Sum)
- 1879
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11220
- Möbius Function
- 1
- Radical
- 13097
- 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
- 125
- 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
- The maximal number of partitions of {1..2n} that are invariant under a permutation consisting of n 2-cycles, and which have the same number of nonempty parts.at n=7A002873
- Upper bound on minimal norm of a quadratic form where n runs over the odd primes.at n=7A038501
- 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=32A063048
- 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=33A088753
- a(n) = smallest non-palindromic k such that the Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A070788(n).at n=19A089494
- a(n) = 104*n + 9977.at n=30A126978
- Let f(n) = exp(Pi*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10^3.at n=18A127028
- Numbers such that Liouville's function (A002819) and the little omega analog to Liouville's function (A174863) are equal.at n=29A224987
- a(n) = Sum_{k=0..3} binomial(6,k)*binomial(n,k).at n=16A247608
- Number of (n+1) X (2+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=2A250847
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=8A250853
- Number of (3+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=1A250855
- Number of tilings of a 7 X n rectangle using pentominoes of shapes W, U, X and monominoes.at n=4A273477
- Irregular triangle read by rows: T(n,k) is the number of k-partitions of {1..2n} that are invariant under a permutation consisting of n 2-cycles (1 <= k <= 2n).at n=47A293181
- Number of achiral color patterns (set partitions) for a row or loop of length n using exactly 6 colors (sets).at n=14A304976
- 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=31A306232
- Numbers k such that the second k binary digits of Pi represent a prime (leading zeros allowed).at n=9A333649