1159
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1240
- Proper Divisor Sum (Aliquot Sum)
- 81
- 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
- 1080
- Möbius Function
- 1
- Radical
- 1159
- 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
- 57
- 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+1) = a(n)^2 - a(n)*a(n-1) + a(n-1)^2.at n=5A000317
- Centered octahedral numbers (crystal ball sequence for cubic lattice).at n=9A001845
- Numbers of the form (p^2 - 49)/120 where p is prime.at n=38A002382
- a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n^2 + 5)/6.at n=19A004006
- "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=22A004210
- Mian-Chowla sequence (a B_2 sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct.at n=28A005282
- a(n) = a(n-1) + 3*a(n-2) for n > 1, a(0) = a(1) = 1.at n=9A006130
- The generalized Conway-Guy sequence w^{1}.at n=12A006755
- Number of independent polynomial invariants of matrix of order n.at n=8A007718
- Coordination sequence T2 for Zeolite Code MTW.at n=22A008197
- Coordination sequence T1 for Zeolite Code YUG.at n=22A008247
- Coordination sequence for tridymite, lonsdaleite, and wurtzite.at n=21A008264
- Composite but smallest prime factor >= 17.at n=35A008367
- Crystal ball sequence for 9-dimensional cubic lattice.at n=3A008419
- Coordination sequence T1 for Zeolite Code AHT.at n=23A009866
- Coordination sequence T2 for Zeolite Code iRON.at n=24A009882
- Six iterations of Reverse and Add are needed to reach a palindrome.at n=17A015984
- Powers of fourth root of 23 rounded up.at n=9A018113
- Pseudoprimes to base 75.at n=11A020203
- Strong pseudoprimes to base 75.at n=6A020301