13684
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 26208
- Proper Divisor Sum (Aliquot Sum)
- 12524
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6200
- Möbius Function
- 0
- Radical
- 6842
- 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
- yes
- 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
- Total number of prime parts in all partitions of n.at n=27A037032
- Records in A065925.at n=19A065927
- a(n) = floor(surface area of a sphere with radius n).at n=32A066644
- Row sums in A082259.at n=10A082261
- Bell triangle A011971 squared.at n=15A095799
- n times pi(n) is made of nontrivial runs of identical digits, where pi(n)=A000720(n).at n=8A116057
- Twice partition numbers.at n=31A139582
- Number of partitions of n times number of divisors of n.at n=30A141667
- Result of using the primes as coefficients in an infinite polynomial series in x and then expressing this series as (1+a(1)x)(1+a(2)x^2)(1+a(3)x^3)...at n=17A147557
- Consider all Consecutive Integer Pythagorean 9-tuples (X,X+1,X+2,X+3,X+4,Z-3,Z-2,Z-1,Z) ordered by increasing Z; sequence gives Z values.at n=3A157093
- a(n) = n^2 + a(n-1), with a(1)=0.at n=33A168559
- Number of 6-step S, E, and NW-moving king's tours on an n X n board summed over all starting positions.at n=12A187511
- Column 3 of array in A226513.at n=21A226514
- Number of ballot sequences of length n having exactly one descent.at n=12A241794
- Numbers n such that Bernoulli number B_{n} has denominator 690.at n=19A272186
- G.f. A(x) satisfies: A( x*A(x) - A(x)^2 ) = -x^3.at n=11A273955
- a(n) = e*(Gamma(2*n,1) - Gamma(n,1)).at n=4A294040
- Number of non-isomorphic multiset partitions of weight n in which all parts have the same size.at n=31A306017
- Dirichlet self-convolution of the integer partition numbers A000041.at n=31A323764
- Least k such that there are exactly A003586(n) ways to choose a binary index of each binary index of k.at n=42A368111