5842
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
- 8
- Divisor Sum
- 9216
- Proper Divisor Sum (Aliquot Sum)
- 3374
- 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
- 2772
- Möbius Function
- -1
- Radical
- 5842
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 80
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Padovan sequence (or Padovan numbers): a(n) = a(n-2) + a(n-3) with a(0) = 1, a(1) = a(2) = 0.at n=37A000931
- a(0) = 0, a(1) = a(2) = a(3) = 1; thereafter, a(n) = a(n-1) + a(n-2) + a(n-4).at n=18A005251
- a(n) = (n+1)*(n^2+n+2)/2; g.f.: (1 + 2*x^2) / (1 - x)^4.at n=22A006000
- Pisot sequences E(4,7), P(4,7).at n=13A010901
- Pisot sequences E(3,7), P(3,7).at n=9A010912
- Take every 5th term of Padovan sequence A000931, beginning with the third term.at n=7A012814
- Pisot sequences E(7,9), P(7,9).at n=24A020720
- Convolution of natural numbers with composite numbers.at n=25A023539
- (s(n)+1)/9, where s(n)=n-th base 9 palindrome that starts with 8.at n=21A043079
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049727.at n=39A049739
- a(n) = Sum_{k=1..n} lcm(n,k).at n=22A051193
- a(n) is twice the smallest k such that A051686(k) = prime(n).at n=37A051692
- Twice the positions in A051686 at which new primes appear in that sequence.at n=31A051861
- Product of n-th prime number and n-th composite number.at n=30A067563
- Expansion of (1 - x)/(1 - x^2 - x^3).at n=39A078027
- a(n+3) = 3*a(n+2) - 2*a(n+1) + a(n).at n=10A095263
- Number of n-th generation triangles in the tiling of the hyperbolic plane by triangles with angles {Pi/2, Pi/3, 0}.at n=27A096231
- Triangle read by rows: T(n,k) is number of peakless Motzkin paths of length n and having k UHH...HD's starting above level 0, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=47A098073
- Unicode codes for the lunation runes, used in certain medieval Scandinavian perpetual calendar staves as golden numbers 1-19.at n=12A098476
- Number of partitions of n in which the number of parts is relatively prime to n.at n=32A102628