13604
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 11596
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6408
- Möbius Function
- 0
- Radical
- 6802
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 89
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that k^2 is palindromic in base 15.at n=46A030073
- a(0)=1, for n>0: a(n) = 4*9^(n-1) - (1/2)*Sum_{i=1..n-1} a(i)*a(n-i).at n=5A085363
- Even numbers n such that 37^2 (the square of the first irregular prime) divides the numerator of Bernoulli(n).at n=24A090789
- Expansion of (eta(q^2)eta(q^6)/(eta(q)eta(q^3)))^6 in powers of q.at n=9A123653
- A Fibonacci-based recurrence.at n=22A139759
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, 0, 1), (0, 1, 1), (1, 0, -1)}.at n=8A150037
- Numbers n such that 2^n divided by the number of digits of 2^n is an integer.at n=42A158520
- Expansion of (4-6*x-6*x^2+x^3)/((1+x)*(1-3*x+x^3)).at n=9A188128
- Positive integers m with 2^m + p(m) prime, where p(.) is the partition function (A000041).at n=19A230508
- Numbers m such that the decimal number concat(8,m) is a square.at n=24A273363
- Number of magic labelings of the graph LOOP X C_9 (see comments) having magic sum n, n >= 0.at n=3A293310
- Triangle read by rows: T(n,k) is the number of unlabeled simple 3-connected graphs with n nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n*(n-1)/2).at n=46A339072
- Smallest even fundamental discriminant k such that h(-k) = 2n, where h(D) is the class number of the quadratic field with discriminant D; or 0 if no such k exists.at n=45A344072
- Triangle read by rows: Number of walks from (0,0) to (3n,3k) on the square lattice with up and right steps where squares (x,y)=(1,1) mod 3 or (x,y)=(2,2) mod 3 are not entered.at n=20A348595
- Triangle read by rows: the almost-Riordan array ( 1/(1-x) | 2/((1-x)*(1+x+sqrt(5*x^2-6*x+1))), (1-3*x-sqrt(5*x^2-6*x+1))/(2x) ).at n=49A373746
- Standard composition numbers of compositions whose maximal runs all belong to {(1), (2,2), (3,3,3), ...}.at n=22A389530