13715
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17808
- Proper Divisor Sum (Aliquot Sum)
- 4093
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10080
- Möbius Function
- -1
- Radical
- 13715
- 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
- Number of bipartite partitions of n white objects and 8 black ones.at n=9A002757
- Number of bipartite partitions of n white objects and 9 black ones.at n=8A002758
- Least term in period of continued fraction for sqrt(n) is 9.at n=14A031433
- Positions of 4-digit terms in the continued fraction for Pi (3 is at position 0).at n=15A048959
- Partial sums of A014824.at n=5A052262
- Number of bipartite partitions of ceiling(n/2) white objects and floor(n/2) black ones.at n=17A091437
- Positive integers i for which A112049(i) == 7.at n=35A112067
- Generalized Pascal Triangle - satisfying the same recurrence as Pascal's triangle, but with a(n,0)=1 and a(n,n)=10^n (instead of both being 1).at n=32A164844
- a(n)=floor(3*n^2*(2+sqrt(3))).at n=34A172526
- a(n) = 81*n^2 + 2*n.at n=12A177099
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,4,3,0,1 for x=0,1,2,3,4.at n=8A196781
- T(n,k) = Number of n X k 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,4,3,0,1 for x=0,1,2,3,4.at n=57A196786
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of partitions of (n,k) into a sum of pairs.at n=53A201376
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 630", based on the 5-celled von Neumann neighborhood.at n=30A269543
- a(n) = A273059(4n+1).at n=20A275917
- Number of multisets of nonempty words with a total of n letters over septenary alphabet containing the seventh letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=5A293802
- Numbers k such that lambda(k) = lambda(k+2), where lambda is the Carmichael lambda function (A002322).at n=26A333742
- Irregular triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k symmetric valleys, with k >= 0.at n=26A372875
- Numbers that are the concatenation of three (not necessarily distinct) primes whose sum is prime, and are also the product of three (not necessarily distinct) primes whose sum is prime.at n=32A385452