5873
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
- 4
- Divisor Sum
- 6720
- Proper Divisor Sum (Aliquot Sum)
- 847
- 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
- 5028
- Möbius Function
- 1
- Radical
- 5873
- 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
- 98
- 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
- Coordination sequence T5 for Zeolite Code MTT.at n=47A008193
- Coordination sequence for FeS2-Pyrite, S position.at n=37A009956
- "CIK" (necklace, indistinct, unlabeled) transform of 3,5,7...at n=6A032199
- a(n) is the number of subsequences {s(k)} of {1,2,3,...n} such that s(k+1)-s(k) is 1 or 3.at n=18A050228
- One sixth of the unitary sociable numbers.at n=4A097323
- Lenny Conundrum #168: Neopet species in alphabetical order, converted to digits by the phone keypad code.at n=30A119568
- Numbers k such that k divides Sum_{j=1..k} j^j = A001923(k).at n=8A128981
- a(n) = 839*n.at n=7A135639
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-0111-0001-0001 pattern in any orientation.at n=10A147284
- Number of lower triangles of an n X n 0..2 array with no element differing from any of its horizontal or vertical neighbors by more than one.at n=3A194925
- T(n,k)=Number of lower triangles of an n X n 0..k array with no element differing from any of its horizontal or vertical neighbors by more than one.at n=13A194931
- Number of lower triangles of a 4 X 4 0..n array with no element differing from any of its horizontal or vertical neighbors by more than one.at n=1A194933
- Numbers k that divide the sum of the first k numbers from Flavius Josephus's sieve (A099074).at n=16A218665
- Number of 2Xn 0..1 arrays with no more than floor(2Xn/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=9A223013
- Number of partitions of n that sorted in increasing order do not contain a part k in position k.at n=49A238394
- Maximum of the partition function on the set of all partitions of n minus the number of partitions of n.at n=21A239314
- Number of partitions p of n such that the number of parts having multiplicity 1 is a part and max(p) - min(p) is not a part.at n=34A241449
- Odd numbers k such that A098548(k) is not a multiple of 3.at n=21A251540
- Number of sum-free sets that can be created by adding n to all sum-free sets [1..n-1].at n=20A288728
- Total number of blocks in all set partitions of strict integer partitions of n.at n=23A330765