13347
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 19292
- Proper Divisor Sum (Aliquot Sum)
- 5945
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8892
- Möbius Function
- 0
- Radical
- 4449
- Omega Function (Ω)
- 3
- 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
- 32
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = (n+3)^3 - n^3.at n=36A038865
- Expansion of Product_{k>=1} (1 + A001055(k)*x^k).at n=40A066816
- a(1) = 9, then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=42A083995
- Number of (n+1)X2 0..2 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.at n=5A185498
- Number of (n+1)X7 0..2 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.at n=0A185503
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.at n=15A185504
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.at n=20A185504
- Number of nX5 0..2 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=2A223915
- T(n,k)=Number of nXk 0..2 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=23A223918
- Number of 3Xn 0..2 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=4A223920
- Number of integers in n-th generation of tree T(1/2) defined in Comments.at n=26A274142
- Triangle T(n, k) is the number of times 2^k*3^(-n) arises in the n-th partition appearing in an iterated sequence of partitions of 1 (one for each integer n) into numbers of the form 2^k*3^(-n), for n>=0, read by rows.at n=55A348863
- a(n) = Sum_{k=0..floor(n/3)} binomial(2*n-5*k,n-3*k).at n=8A360152
- Coefficients of the power series expansion at p=1 of the time constant C(-2,p) for last passage percolation on the complete directed acyclic graph, where the edges' weights are equal to 1 or -2 with respective probabilities p and 1-p.at n=16A373090
- Number of 1-unbordered words of length n over a 3-letter alphabet beginning with a fixed letter.at n=10A375016