5830
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 11664
- Proper Divisor Sum (Aliquot Sum)
- 5834
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- yes
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2080
- Möbius Function
- 1
- Radical
- 5830
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 36
- 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
- Sum of Fibonacci (A000045) and Pell (A000129) numbers.at n=11A001932
- Primitive weird numbers: weird numbers with no proper weird divisors.at n=3A002975
- Weird numbers: abundant (A005101) but not pseudoperfect (A005835).at n=3A006037
- a(n) = floor( n*(n-1)*(n-2)/27 ).at n=55A011909
- Sum of first prime(n) primes.at n=15A022094
- a(n) = [ C(2n,n)/n^2 ].at n=10A024500
- (d(n)-r(n))/5, where d = A008778 and r is the periodic sequence with fundamental period (0,3,1,0,1).at n=52A026053
- a(n) = T(n,n-3), where T is the array in A026386.at n=21A026394
- G.f.: 1/((1-x)*(1-x^2))^5.at n=9A038165
- Denominators of continued fraction convergents to sqrt(182).at n=5A041337
- Base-9 palindromes that start with 7.at n=19A043034
- Numbers k such that sigma(k) == 4 (mod k).at n=8A045769
- a(n) is the sum of the first A045345(n) primes.at n=2A050247
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=20A052049
- Number of partitions into at most a(1) copies of 1, a(2) copies of 2, ...at n=43A052337
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives i values.at n=32A053719
- Composite numbers arising as sum of first k primes.at n=46A053790
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2, 3) = binomial(j+2, 3) + k^3, ordered by increasing i; sequence gives j values.at n=28A054222
- Expansion of (5+10*x+x^2)/(1-x)^10.at n=4A059602
- a(n) = (binomial(2*p,p)-2)/p^2 where p = prime(n).at n=4A060842