13588
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24640
- Proper Divisor Sum (Aliquot Sum)
- 11052
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6552
- Möbius Function
- 0
- Radical
- 6794
- 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
- 63
- 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
- Number of disconnected graphs with n nodes.at n=9A000719
- Numbers n such that n | (sigma_4(n) + phi(n)^4).at n=3A055698
- Numbers k such that 100k+1, 100k+3, 100k+7, 100k+9 are all primes.at n=20A064687
- n coded as binary word of length=n with k-th bit set iff k is prime (1<=k<=n), decimal value.at n=14A072762
- Numbers k such that 9*10^k - 11 is prime.at n=13A100275
- a(n) = A112260(n+1) - A112260(n).at n=12A112261
- Numbers such that the sum of the factorials of the digits of the cube is a square.at n=37A126076
- Row sums of A163357 and A163359.at n=25A163365
- Number of (n+1) X (2+1) 0..7 arrays with every 2 X 2 subblock having the sum of the squares of the edge differences equal to 26.at n=1A233719
- T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 26 (26 maximizes T(1,1)).at n=4A233724
- Number T(n,k) of sequences in {1,...,n}^n with longest increasing subsequence of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=33A245667
- Number of zeros on each row of irregular tables A252743 and A252744.at n=23A252746
- Triangle read by rows: T(n,k) = number of unlabeled graphs with n nodes and connectivity exactly k (n>=1, 0<=k<=n-1).at n=36A259862
- Triangle read by rows: T(n,k) is the number of graphs with n vertices with edge connectivity k.at n=36A263296
- Number of sequences in {1,...,n}^n with longest increasing subsequence of length five.at n=2A268872
- Number of sequences in {1,...,n}^n with longest increasing subsequence of length n-2.at n=7A268936
- G.f.: Product_{k>=1} (1+x^(k^2)) / (1-x^k).at n=29A280204
- G.f.: Sum_{k>=1} x^(2*k-1)/(1+x^(2*k-1)) * Product_{k>=1} 1/(1-x^k).at n=32A305123
- Triangle read by rows: T(n,k) = number of Dyck paths with n nodes and altitude k (1 <= k <= n).at n=57A318942
- Number of Dyck paths with n nodes and altitude 3.at n=11A318943