13087
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13680
- Proper Divisor Sum (Aliquot Sum)
- 593
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12496
- Möbius Function
- 1
- Radical
- 13087
- 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
- 107
- 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
- Number of partitions satisfying cn(2,5) <= cn(0,5) and cn(3,5) <= cn(0,5).at n=42A039863
- Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553.at n=3A063061
- a(0)=1. a(n) = a(n-1) + (largest integer occurring among {a(0),a(1),a(2),...,a(n-1)} that is coprime to n).at n=21A120938
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 2-cell columns (n>=1; 0<=k<=n-1). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=29A121637
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (1,4,4,...) and super- and subdiagonals (1,1,1,...).at n=29A124576
- Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, 0), (1, 1)}.at n=8A151373
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2<x^2+y^2.at n=26A211635
- Number of length n+5 0..6 arrays with every six consecutive terms having five times some element equal to the sum of the remaining five.at n=0A249495
- T(n,k)=Number of length n+5 0..k arrays with every six consecutive terms having five times some element equal to the sum of the remaining five.at n=15A249497
- Number of length 1+5 0..n arrays with every six consecutive terms having five times some element equal to the sum of the remaining five.at n=5A249498
- a(n) = G_n(5), where G_n(k) is the Goodstein function defined in A266201.at n=14A266204
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 910", based on the 5-celled von Neumann neighborhood.at n=34A273764
- Total number of binary digits in the partitions of n into odd parts.at n=35A319142
- Number of complex base i-1 points which can be represented within n bits and negated within those n bits.at n=15A340670