13410
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 35100
- Proper Divisor Sum (Aliquot Sum)
- 21690
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3552
- Möbius Function
- 0
- Radical
- 4470
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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 2n-step self-avoiding closed walks on first octant of 3-dimensional cubic lattice, passing through origin.at n=6A039618
- Numerators of continued fraction convergents to sqrt(892).at n=5A042724
- Numbers k such that 2*6^k - 1 is prime.at n=36A057472
- a(n) = 3*(n - 2)*(5*n -11).at n=30A060785
- Numbers k such that 4*k-1, 8*k-1, 16*k-1 and 32*k-1 are all primes.at n=7A101794
- Numbers k such that 4*k-1, 8*k-1, 16*k-1, 32*k-1 and 64*k-1 are all primes.at n=1A101994
- a(n) is the number whose binary representation is the concatenation of the divisors of n written in base 2.at n=33A182622
- Number of standard puzzles of shape 2 X n with support CK (see reference for precise definition).at n=9A196265
- Number of maximal 2-independent sets in the planar 3 X n grid graph.at n=14A231882
- E.g.f. A(x) satisfies: A(x) = exp( Integral B(x) dx ) such that B(x) = exp(1+x - exp(x)) * exp( Integral A(x) dx ), where the constant of integration is zero.at n=8A268170
- Number of nX7 0..1 arrays with every element unequal to 0, 1, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=8A318081
- Expansion of g.f. A(x) = G( x*(1 + 2*x)*G(x) )^(1/2) = G( x*(1 + 3*x)*G(x)^2 )^(1/3), where G(x) is the g.f. of A370537.at n=10A370538
- G.f. A(x) = exp( Sum_{n>=1} sigma(n)*sigma(2*n) * x^n/n ), where sigma(n) = A000203(n) is the sum of the divisors of n.at n=8A382125