13785
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22080
- Proper Divisor Sum (Aliquot Sum)
- 8295
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7344
- Möbius Function
- -1
- Radical
- 13785
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- a(n) = Sum_{k=0..n} C(n-k,3k).at n=18A003522
- a(n) = a(n-3) + a(n-4), with a(0)=1, a(1)=a(2)=0, a(3)=1.at n=54A017817
- Number of ways of numbering the faces of a cube with nonnegative integers so that the sum of the 6 numbers is n.at n=30A054473
- Numbers k such that 10*13^k + 1 is prime.at n=17A057464
- Number of compositions of n such that two adjacent parts are not equal modulo 2.at n=25A062200
- Numbers n such that 6^n+5 is prime.at n=21A145106
- a(n) = number of primes p, p <= 2^n, where 2^n + p is prime.at n=21A175147
- Number of black square subarrays of (n+1)X(n+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=5A231066
- Number of black square subarrays of (n+1)X(6+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=5A231069
- T(n,k)=Number of black square subarrays of (n+1)X(k+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=60A231070
- Number of length n 0..4 arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=5A244828
- T(n,k) = Number of length n 0..k arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=41A244832
- Number of length 6 0..n arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=3A244837
- Number of unordered pairs of partitions of n with no common parts.at n=19A260669
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 601", based on the 5-celled von Neumann neighborhood.at n=15A283220
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 7 or 8 king-move adjacent elements, with upper left element zero.at n=9A316513
- Number of dominating sets in the n-dipyramidal graph.at n=11A347503
- Expansion of Product_{k>=1} (1-x^k/Product_{j=1..k} (1-x^j)).at n=25A350587
- Number of ways to write a + b + c = d + e = f with {a,b,c,d,e,f} a subset of [n] of size 6 and a < b < c and d < e.at n=38A362717
- Number of ways to write n as a nonnegative linear combination of a strict integer composition of n.at n=15A364909