13804
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 16436
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 6902
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 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
- a(n) = (5*n+1)*(5*n+4).at n=23A001545
- Number of graphs with a distinguished bipartite block, by number of vertices.at n=10A049312
- Inverse of binomial transform of Whitney triangle.at n=48A097761
- Number of compositions into a prime number of distinct parts.at n=28A102623
- Rectangular table, read by antidiagonals, defined by the following rule: start with all 1's in row zero; from then on, row n+1 equals the partial sums of row n excluding terms in columns k = m*(m+1)/2 - 2 (m>=2).at n=59A125781
- Column 4 of table A125781.at n=6A125784
- a(n) = 2*n*(6*n-1).at n=34A126964
- E.g.f. satisfies: A'(x) = 1 + x*A(x)^2 where A(0) = 1.at n=8A144012
- Riordan array (2c(-x)-1, xc(-x)^3), c(x) the g.f. of A000108.at n=38A159971
- a(n) = 17*n*(n+1).at n=28A173308
- Expansion of (1-2*x-2*x^2-sqrt(1-4*x-4*x^2+8*x^3+4*x^4))/(2*x^2).at n=8A174403
- Numbers k such that k^3 divides 15^(k^2) - 1.at n=37A177915
- a(n) = n(F(n+2) - 1) where F(n) is defined by A000045.at n=14A179023
- Triangle T(n,k) with the coefficient [x^k] of 1/(1-2*x-x^2+x^3)^(n-k+1) in row n, column k.at n=64A188106
- Expansion of (x^2)/(1-2*x-x^2+x^3)^2.at n=11A189426
- Subsequence of lesser of 2 terms of A095301 that are 2 apart.at n=4A248083
- a(n) = n*((4*n + 1)*(7*n - 4) + 15*n*(-1)^n)/48.at n=28A302766
- Sum of the sixth largest parts in the partitions of n into 7 parts.at n=46A308928
- Expansion of e.g.f. 1 / (1 - x)^sech(x).at n=8A351883
- Numbers k such that the odd part of sigma(sigma(k)) is equal to the odd part of sigma(k).at n=37A353365