5583
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7448
- Proper Divisor Sum (Aliquot Sum)
- 1865
- 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
- 3720
- Möbius Function
- 1
- Radical
- 5583
- Omega Function (Ω)
- 2
- 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
- 67
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers having period-1 7-digitized sequences.at n=33A031201
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 48.at n=32A031546
- Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(2,5) + cn(3,5) and 0 < cn(0,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=30A039903
- Number of primitive (period n) n-bead necklaces with exactly three different colored beads.at n=9A056288
- Area of all nondecreasing Dyck paths of length 2n.at n=6A061648
- Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.at n=26A063052
- Assume the conjectured terms of A105594 are the correct beginnings of the trajectories described in A003508. a(n) is a record length of b(n) iterations to arrive at the collected trajectories. This sequence cites the a(n)'s.at n=14A105600
- Number of pentagonal numbers with n digits.at n=7A117712
- a(1)=a(2)=1. a(n+1) = a(n) + a(largest prime dividing n).at n=32A128215
- a(n) = C(3,n) DELTA C(0,n).at n=23A147724
- Number of standard Young tableaux with n cells without a succession v, v+1 in a row.at n=11A237770
- Triangle read by rows: T(n,k) gives the number of ballot sequences of length n having exactly k flat steps, n>=0, 0<=k<=n.at n=66A238125
- Number of n X 2 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the sum of elements above it, modulo 3.at n=31A238806
- Numbers n such that n^8+8 and n^8-8 are prime.at n=8A239503
- Number of partitions p of n such that m(p) < m(c(p)), where m = maximal multiplicity of parts, and c = conjugate.at n=33A240726
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 57", based on the 5-celled von Neumann neighborhood.at n=20A270077
- First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 369", based on the 5-celled von Neumann neighborhood.at n=42A270793
- Coordination sequence for "svh" 3D uniform tiling.at n=33A299283
- Numbers that are equal to the sum of their iterated absolute alternating sum-of-divisors function (A206369).at n=12A331017
- Total number of edges in graph formed by the straight line segments connecting the edges of an equilateral triangle with the n-1 points resulting from a subdivision of the sides into n equal pieces.at n=30A332376