5096
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 11970
- Proper Divisor Sum (Aliquot Sum)
- 6874
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2016
- Möbius Function
- 0
- Radical
- 182
- Omega Function (Ω)
- 6
- 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
- 59
- 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 symmetric relations on n nodes.at n=6A000666
- Expansion of (1-x)^(-3) * (1-x^2)^(-2).at n=23A002624
- a(n) = n*(n+1)*(n+2)^2/6.at n=12A004320
- From the enumeration of corners.at n=6A006332
- G.f.: Product_{k>=1} (1 + x^(2*k - 1)) / (1 - x^(2*k)).at n=40A006950
- tanh(arcsinh(x)*exp(x)) = x+2/2!*x^2-24/4!*x^4-140/5!*x^5-200/6!*x^6...at n=7A012591
- Self-convolution of (1, p(1), p(2), ...).at n=17A023626
- Expansion of 1/((1-2x)(1-5x)(1-6x)(1-11x)).at n=3A025990
- a(n) = Sum_{k=0..floor((n-1)/2)} T(n,k) * T(n,k+2), with T given by A026022.at n=6A027296
- a(n) = (n+1)*binomial(n+1,11).at n=3A027771
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 7 (most significant digit on left).at n=43A029452
- Numbers k such that 177*2^k+1 is prime.at n=41A032465
- Number of matchings in graph P_{3} X P_{n}.at n=5A033506
- Number of matchings in graph P_{5} X P_{n}.at n=3A033508
- Trajectory of 1 under map n->43n+1 if n odd, n->n/2 if n even.at n=7A033977
- Number of possible rook moves on an n X n chessboard.at n=13A035006
- Numbers whose base-3 representation contains exactly two 0's and no 1's.at n=39A044975
- Number of border edges in all noncrossing rooted trees on n nodes.at n=5A045722
- Honaker's triangle problem: form a triangle with base of length n, all entries different, all row sums equal; a(n) gives minimal row sum.at n=31A047837
- a(n) = max_{r=1..n-1} ceiling(t(t(n)-t(r-1))/(n-r+1)), where t() = triangular numbers A000217.at n=31A047873