13496
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 29040
- Proper Divisor Sum (Aliquot Sum)
- 15544
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- 0
- Radical
- 3374
- Omega Function (Ω)
- 5
- 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
- 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
- Expansion of e.g.f. arcsin(tan(x) * exp(x)).at n=7A012361
- Number of self-avoiding closed walks (from 0 to 0) of length 2n in the strip {0, 1, 2} X Z of the square lattice Z X Z.at n=11A022445
- Expansion of 1/((1-3x)(1-8x)(1-11x)(1-12x)).at n=3A028104
- Numbers k such that 7*2^k+1 is prime.at n=22A032353
- Column 2 of the array m(i,1)=m(1,j)=1 m(i,j)=m(i-1,j-1)+m(i-1,j+1) (a(n)=m(n,2)).at n=16A072100
- Bell number A000110(n) minus Bessel number A006789(n).at n=9A153820
- Triangle T(n,k) read by rows: the coefficient [x^k] of the series (1-x)^(2n-1)*Sum_{l>=0} A001263(n+3*l,3*l+1)*x^l, in row n>=1 with exponents k>=0.at n=40A178658
- Number of -n..n arrays x(0..3) of 4 elements with zero sum, and adjacent elements not equal modulo three (with -1 modulo 3 = 2).at n=19A199911
- Square root of number of nX4 arrays of occupancy after each element moves to some horizontal or vertical neighbor, with every occupancy equal to zero or two.at n=10A221313
- Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A237724
- Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A237725
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=7A237730
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=8A237730
- Numbers whose abundance is a power of 2.at n=43A259174
- Numbers n such that Bernoulli number B_{n} has denominator 870.at n=45A272185
- Indices of records in A305382.at n=14A306035
- Sum over all partitions of n into distinct parts of the bitwise XOR of the parts.at n=37A306925
- Sum of the smallest parts in the partitions of n into 7 parts.at n=49A308927
- Index of first occurrence of n in A305382.at n=21A316226
- Expansion of e.g.f. -log(1 - Sum_{k>=1} x^(k*(k + 1)/2) / (k*(k + 1)/2)!).at n=8A329258