13696
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
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27540
- Proper Divisor Sum (Aliquot Sum)
- 13844
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6784
- Möbius Function
- 0
- Radical
- 214
- Omega Function (Ω)
- 8
- Little Omega Function (ω)
- 2
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
- 107
- 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 partitions with no even part repeated; partitions of n in which no parts are multiples of 4.at n=41A001935
- EXPCONV of squares A000290 with themselves.at n=6A033463
- Trajectory of 1 under map n->43n+1 if n odd, n->n/2 if n even.at n=12A033977
- Number of partitions of 2n+1 in which no parts are multiples of 4.at n=20A081056
- G.f.: A(x) = exp( 2*Sum_{n>=1} sigma(n)*A006519(n) * x^n/n ), where A006519(n) = highest power of 2 dividing n.at n=12A162584
- A bisection of A162584.at n=6A163228
- Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + 2*x - 4*x^2)/(1 - 2*x - 8*x^2).at n=7A179607
- Products of the 7th power of a prime and a distinct prime (p^7*q).at n=28A179664
- Number of nondecreasing arrangements of 4 nonzero numbers in -(n+2)..(n+2) with sum zero.at n=36A188334
- Numerators of hypergeometric Cauchy numbers c_(4,n).at n=5A224092
- Number of defective 4-colorings of an n X 6 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..3 order.at n=8A229576
- Number of tilings of a 18 X n rectangle using 2n nonominoes of shape I.at n=26A250666
- Number of binary strings of length n+5 such that the smallest number whose binary representation is not visible in the string is 7.at n=11A261443
- a(n) = n^2*(7*n - 5)/2.at n=16A262000
- Number of ways to choose three distinct points from a 5 X n grid so that they form an isosceles triangle.at n=31A271915
- Number of n-step self-avoiding nonintersecting walks on the square lattice with diagonals allowed (corresponds to using the Moore neighborhood).at n=5A272773
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 521", based on the 5-celled von Neumann neighborhood.at n=15A282829
- a(n) is the number of vertices in the diagram of partitions of n (see example).at n=29A299475
- Number of permutations of [n] whose lengths of increasing runs are distinct prime numbers.at n=10A317447
- Infinitary Zumkeller numbers (A335197) whose set of infinitary divisors can be partitioned into two disjoint sets of equal sum in a single way.at n=38A335199