5972
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10458
- Proper Divisor Sum (Aliquot Sum)
- 4486
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2984
- Möbius Function
- 0
- Radical
- 2986
- Omega Function (Ω)
- 3
- 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
- 23
- 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
- Sum a(n) x^n / n = log (1 + Sum g(n) x^n ), where g(n) is # graphs on n nodes (A000088).at n=6A003083
- Number of symmetric Latin squares of order 2n with constant diagonal.at n=3A003191
- a(n) = floor(n*(n - 1)*(n - 2)/31).at n=58A011913
- Iccanobif numbers: add reversal of a(n-1) to a(n-2).at n=19A014259
- a(n) = number of (s(0),s(1),...,s(n)) such that every s(i) is a nonnegative integer, s(0) = 1, s(n) = 5, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-4), where T is the array in A026120.at n=7A026126
- Expansion of Product_{m>=1} (1+q^m)^(m^2).at n=10A027998
- Numbers k such that 213*2^k+1 is prime.at n=13A032483
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) < cn(3,5).at n=65A036863
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) <= cn(2,5) = cn(4,5).at n=72A036872
- Number of partitions satisfying cn(2,5) < cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) < cn(0,5) + cn(1,5) + cn(4,5).at n=31A039873
- Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities).at n=27A045940
- a(n) = Sum_{ d divides n } q(d), where q(d) = A000009 = number of partitions of d into distinct parts.at n=53A047966
- a(n) is the smallest number k such that k! contains k exactly n times.at n=8A061014
- Triangle read by rows: T(n,k) is number of peakless Motzkin paths of length n and having k uhh...hd's starting at level 0, where u=(1,1), h=(1,0) and d=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=53A098071
- Related to enumeration of rooted catapolyoctagons (see Cyvin reference for precise definition).at n=10A121118
- Numbers n such that n, n+1, n+2 and n+3 are products of exactly 3 primes.at n=26A124057
- Expansion of x/((1-x)^2(1+x-x^3-x^4-x^5-x^6-x^7+x^9+x^10)).at n=41A143611
- Number of zig-zag paths from top to bottom of a rectangle of width 10 with n rows.at n=10A153360
- a(n) = a(n-1) + A073053(a(n-1)).at n=28A173578
- G.f.: exp( Sum_{n>=1} x^n/n * Sum_{k=0..n} binomial(n^2, k^2) * x^k ).at n=7A206850