13098
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
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27360
- Proper Divisor Sum (Aliquot Sum)
- 14262
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4176
- Möbius Function
- 1
- Radical
- 13098
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 45
- 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
- yes
- Odd
- no
Appears in sequences
- Fibonacci sequence beginning 4, 19.at n=15A022135
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) (A004086) both are divisible by the n-th prime.at n=16A075605
- Number of compositions of n in which the largest part is equal to the number of parts.at n=19A098124
- Number of 3-step one space leftwards or up, two space rightwards or down asymmetric rook's tours on an n X n board summed over all starting positions.at n=29A187298
- Half the number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences.at n=1A209905
- Half the number of (n+1)X3 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences.at n=1A209907
- T(n,k)=Half the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences.at n=4A209913
- Numbers such that Liouville's function (A002819) and the little omega analog to Liouville's function (A174863) are equal.at n=30A224987
- a(n) = n*prime(prime(n)) - prime(n)^2.at n=42A230098
- Irregular triangle read by rows: T(n,k) (n>=2, 1<=k<=n) gives number of arrangements of the elements from the multiset M(n, 3) into exactly k disjoint cycles.at n=36A245183
- 5-untouchable numbers.at n=30A284187
- Consider all ways of writing the composite Fibonacci number A090206(n+3) as product of two divisors d1*d2 = d3*d4 = ... The sequence a(n) gives the minimum sums of {d1+d2, d3+d4,...}.at n=25A287273
- G.f. A(x) satisfies: A(x) = A(x^3 - x^5)/x^2.at n=32A350479
- Expansion of Sum_{n>=1} x^(n^2)*((1+x)/(1-x))^n.at n=30A369424