13138
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19710
- Proper Divisor Sum (Aliquot Sum)
- 6572
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6568
- Möbius Function
- 1
- Radical
- 13138
- 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
- 213
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers whose concatenation of prime factors (with multiplicity) is a square.at n=32A038693
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=14A049948
- Number of rooted trees with n nodes and 10 leaves.at n=5A055285
- Number of two-rowed partitions of length 6.at n=24A070559
- Number of isomorphism classes of non-associative non-commutative anti-associative non-anti-commutative closed binary operations on a set of order n.at n=3A079235
- G.f. satisfies: A(x) = 1 + x*A(x)/(1 - x^2*A(x)^2).at n=12A101785
- Largest integer terms forming a self-convolution 4th root of a sequence (A132837) such that: A132837(n) <= 4*A132837(n-1) for n>0 with A132837(0)=1.at n=9A132838
- Triangle read by rows: T(n,k) is the number of Dyck n-paths containing k even-length ascents (0 <= k <= floor(n/2)).at n=42A143950
- Number of planar n X n X n binary triangular grids symmetric both under 120 degree rotation and reflection with no more than 8 ones in any 5 X 5 X 5 subtriangle.at n=12A153964
- Number of binary strings of length n with no substrings equal to 0000, 0001, or 0110.at n=17A164411
- Number of (n+2) X 6 0..2 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..2 introduced in row major order.at n=8A204280
- Triangle read by rows: Number of ideals in Partial Brauer Monoid PB_n.at n=23A276773
- Array read by antidiagonals: T(m,n) = number of maximal irredundant sets in the grid graph P_m X P_n.at n=39A291439
- Array read by antidiagonals: T(m,n) = number of maximal irredundant sets in the grid graph P_m X P_n.at n=41A291439
- Number of "forceless" (or "useless") sequences in n-column Nonogram puzzle.at n=23A304179
- a(n) is the smallest number that is the sum of n positive 6th powers in two ways.at n=31A343079
- Triangle read by rows: T(n,k) gives the number of permutations of length n containing exactly k instances of the 1-box pattern; 0 <= k <= n.at n=52A346462
- G.f. A(x) satisfies A(x) = 1 / ((1 - x) * (1 - x * A(x^3))).at n=19A367691