5559
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7920
- Proper Divisor Sum (Aliquot Sum)
- 2361
- 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
- 3456
- Möbius Function
- -1
- Radical
- 5559
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 160
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (odd natural numbers).at n=19A024592
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (odd natural numbers).at n=18A025106
- Lucky numbers that are concatenations of n with n + 4.at n=6A032654
- a(1) = 3; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=34A033681
- a(1)=1, a(n) = smallest odd number such that all sums of pairs of (not necessarily distinct) terms in the sequence are distinct.at n=39A034757
- Number of pairs {i,j}, i>1, j>1, such that ij < n^2.at n=42A037048
- Numerators of continued fraction convergents to sqrt(541).at n=5A042034
- Denominators of continued fraction convergents to sqrt(598).at n=6A042147
- Numbers having three 5's in base 10.at n=23A043511
- T(n,n), array T given by A047010.at n=8A047012
- 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 k values.at n=38A053721
- a(1) = 1; a(n+1) = floor(sqrt(Sum_{k=1..n} a(k)^2)).at n=28A067859
- a(1) = 4; a(n) = smallest composite number of form k*a(n-1) + 1 with k > 1.at n=9A071258
- A partial product representation of f(n) = A015523(n) and L(n) = A072263(n).at n=8A072271
- Erroneous version of A143293.at n=6A079096
- a(n) = floor(binomial(n+7,7)/binomial(n+3,3)).at n=41A084628
- Values of r such that N(r)/r^2 > Pi, where N(r) is the number of integer lattice points (x,y) inside or on a circle of radius r.at n=34A093832
- Number of partitions of the n-th partition number into integers not greater than the (n-1)-th partition number.at n=8A098716
- a(n) = floor(n^(n/2)/n!!).at n=20A114854
- a(n) = (2*n^3 + 5*n^2 - 9*n)/2.at n=16A162258