13289
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13524
- Proper Divisor Sum (Aliquot Sum)
- 235
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13056
- Möbius Function
- 1
- Radical
- 13289
- 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
- 76
- 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
- f-vectors for simplicial complexes of dimension at most 1 (graphs) on at most n-1 vertices.at n=43A011826
- [ n(n-1)(n-2)(n-3)/7 ].at n=19A011917
- Pseudoprimes to base 96.at n=39A020224
- Numbers k such that the continued fraction for sqrt(k) has period 43.at n=38A020382
- Number of connected functions on n points with a loop of length 11.at n=7A032207
- a(n) = least k such that the remainder of 30^k divided by k is n.at n=18A128370
- a(n) = (4*n^3 - 6*n^2 + 8*n + 3)/3.at n=22A161712
- Fibonacci-Chebyshev sequence depending on rabbit sequence A005614.at n=44A176741
- a(n) gives the number of nonisomorphic connected compact Lie groups of dimension n which are simple products.at n=52A177821
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and 2w+x+y>0.at n=15A211617
- Odd numbers which are factored to the same set of primes in Z as to the irreducible polynomials in GF(2)[X]; odd terms of A235036.at n=26A235039
- Products of pairs made by match-making permutation: a(n) = A266195(n) * A266195(n+1).at n=62A266194
- Number of words of length n over the alphabet {0,1,...,10} such that no two consecutive terms have distance 9.at n=4A287839
- Number of nX3 0..1 arrays with every element unequal to 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=6A305283
- Number of nX7 0..1 arrays with every element unequal to 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=2A305287
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=38A305288
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=42A305288
- Positive integers that have exactly ten representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=1A317400
- a(n) is the smallest positive composite that cannot be expressed as the sum of any subset of earlier terms and is not a multiple of any earlier term.at n=18A330071
- a(n) = number of nonnegative integers that are not the sum of {2 squares, a nonnegative 5th power, and a nonnegative n-th power}.at n=21A332664