5932
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10388
- Proper Divisor Sum (Aliquot Sum)
- 4456
- 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
- 2964
- Möbius Function
- 0
- Radical
- 2966
- 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
- 142
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 88.at n=8A020427
- a(n) = (d(n)-r(n))/2, where d = A026049 and r is the periodic sequence with fundamental period (1,0,0,1).at n=28A026050
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,1,2}.at n=28A080000
- a(1)=1; for n > 1, a(n) = n*(a(n-1) + a(n-2) + ... + a(2) + a(1)) + 4.at n=5A082430
- "The partial sums of the positions where T occurs in this sentence are one, eight, twentyfive, fortynine, eightythree, onehundredtwentysix, ..." (Variation of Aronson's sequence).at n=34A089613
- Total area below the lattice paths of length n defined by the rule [(0),(k)->(k-1)(k+1)] (Dyck paths).at n=9A094893
- Numbers k such that the k-th and (k+1)-th primes have the same sum of squares of digits.at n=22A109182
- a(n) = 4*(n^2 - n + 1).at n=38A112087
- Numbers n such that sigma(sigma(phi(n))) = sigma(sigma(n)).at n=16A172466
- Alternated binomial cumulative sums of the (signless) central Stirling numbers of the first kind (A187646).at n=4A187652
- Number of nonnegative integer arrays of length n+2*4-2 with new values introduced in order 0 upwards and every value appearing only in runs of at least 4.at n=19A211696
- G.f. satisfies: A(x) = x + A( A(x)^2/(1 + A(x)^2) ).at n=9A213264
- Number of partitions of n such that the distinct terms arranged in increasing order form a string of two or more consecutive integers.at n=53A237665
- Index sequence for limit-block extending A000002 (Kolakoski sequence) with first term as initial block.at n=28A246145
- Molien series for invariants of finite Coxeter group D_8 (bisected).at n=33A266771
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 107", based on the 5-celled von Neumann neighborhood.at n=20A270166
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 217", based on the 5-celled von Neumann neighborhood.at n=20A270911
- Numbers such that antisigma(n) mod sigma(n) = d(n), where antisigma(n) is the sum of the numbers less than n that do not divide n, sigma(n) is the sum of the divisors of n and d(n) is the number of divisors of n.at n=40A272337
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 609", based on the 5-celled von Neumann neighborhood.at n=45A273208
- Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square grid such that the picked positions have a central symmetry.at n=24A291717