1059
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1416
- Proper Divisor Sum (Aliquot Sum)
- 357
- 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
- 704
- Möbius Function
- 1
- Radical
- 1059
- 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
- 31
- 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
- a(n) = Sum_{k=0..n} f(k)*f(n-k) where f(k) = A002124(k).at n=26A002125
- Number of integral points in a certain sequence of closed quadrilaterals.at n=48A002579
- Number of solutions to a linear inequality.at n=29A002797
- Numbers k such that k^4 can be written as a sum of four positive 4th powers.at n=3A003294
- Numbers that are the sum of 5 positive 5th powers.at n=21A003350
- "Magic" integers: a(n+1) is the smallest integer m such that there is no overlap between the sets {m, m-a(i), m+a(i): 1 <= i <= n} and {a(i), a(i)-a(j), a(i)+a(j): 1 <= j < i <= n}.at n=21A004210
- Expansion of (1-x+x^2)/((1-x)^2*(1-x^2)*(1-x^4)).at n=34A005232
- Representation degeneracies for Neveu-Schwarz strings.at n=14A005296
- Number of increasing sequences of Goldbach type with maximal element n.at n=13A008929
- Coordination sequence T5 for Zeolite Code CON.at n=23A009872
- Coordination sequence T6 for Zeolite Code CON.at n=23A009873
- A B_2 sequence: a(n) = least value such that the sequence increases and pairwise sums of distinct terms are all distinct.at n=28A010672
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=30A011905
- Number of elements in the set {(x,y): 1 <= x,y <= n, gcd(x,y)=1}.at n=40A018805
- (n-2)-th Catalan number is congruent to 2n/3 mod n.at n=44A019468
- Numbers k such that the continued fraction for sqrt(k) has period 22.at n=21A020361
- [ (4th elementary symmetric function of S(n))/(3rd elementary symmetric function of S(n)) ], where S(n) = {first n+3 positive integers congruent to 2 mod 3}.at n=51A024403
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence), t = A014306.at n=56A024691
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6,..., 1/2n} satisfy r < s, then r < k/m < s for some integer k.at n=26A024820
- a(n) = Sum_{k=1..n} k*floor( prime(k)/k ).at n=26A024927