13503
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20608
- Proper Divisor Sum (Aliquot Sum)
- 7105
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7704
- Möbius Function
- -1
- Radical
- 13503
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 174
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Poincaré series [or Poincare series] (or Molien series) for mod 2 cohomology of universal W-group W(5).at n=6A014700
- Maximal elements of pairs of "Super Unitary Amicable Numbers", sorted by their minimal elements.at n=29A045614
- Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3) = j^3 + k^3, ordered by increasing i; sequence gives i values.at n=10A054205
- Sums of terms of groups in A075621.at n=29A075625
- Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=2A084276
- Number of n X n binary arrays with all ones connected only in a 0100-1100-0111-0001 pattern in any orientation.at n=7A147261
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 0100-1100-0111-0001 pattern in any orientation.at n=16A147263
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 0100-1100-0111-0001 pattern in any orientation.at n=17A147263
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1100-1111-1100 pattern in any orientation.at n=15A147479
- Number of nX4 1..2 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=9A166786
- a(n) = A168174(n)-10^12.at n=18A168248
- Expansion of e.g.f. exp(x) / (3 - 2*exp(x)).at n=5A201339
- Expansion of x^4*(1-3*x^2-x^3)/((1+x)*(1-2*x)*(1-x-2*x^2)).at n=17A219755
- Number of (1+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=38A250756
- Number of length n 1..(4+2) arrays with no leading partial sum equal to a prime.at n=6A254535
- T(n,k)=Number of length n 1..(k+2) arrays with no leading partial sum equal to a prime.at n=51A254539
- Number of length 7 1..(n+2) arrays with no leading partial sum equal to a prime.at n=3A254545
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 998", based on the 5-celled von Neumann neighborhood.at n=30A273857
- Number of compositions of n with distinct circular differences up to sign.at n=26A325553
- Square array A(n, k) = n! * [t^n] (exp(t)/(1+k-k*exp(t))) for n >= 0 and k >= 0, read by antidiagonals upwards.at n=30A369435