1160
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 2700
- Proper Divisor Sum (Aliquot Sum)
- 1540
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 448
- Möbius Function
- 0
- Radical
- 290
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 119
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=19A000125
- Octagonal numbers: n*(3*n-2). Also called star numbers.at n=20A000567
- Generalized octagonal numbers: k*(3*k-2), k=0, +- 1, +- 2, +-3, ...at n=39A001082
- Number of semigroups of order n, considered to be equivalent when they are isomorphic or anti-isomorphic (by reversal of the operator).at n=5A001423
- Number of partitions of floor(5n/2)-1 into n nonnegative integers each no more than 5.at n=19A001976
- Number of bipartite partitions.at n=10A002762
- Denominators of continued fraction convergents to cube root of 7.at n=6A005485
- a(n+1) = (n+1)*a(n) + Sum_{k=1..n-1} a(k)*a(n-k).at n=5A006014
- Number of leftist trees with n leaves.at n=12A006196
- Triangular numbers plus quarter squares: n*(n+1)/2 + floor(n^2/4) (i.e., A000217(n) + A002620(n)).at n=39A006578
- Number of partitions of n into parts of sizes {a( )} is a(n).at n=34A007209
- Oscillates under partition transform.at n=29A007211
- Coordination sequence T2 for Zeolite Code AFY.at n=28A008030
- Coordination sequence T3 for Zeolite Code MEI.at n=25A008148
- Expansion of tan(sin(x)/cosh(x)).at n=3A009674
- Numbers k such that C(k,3) = C(x,3) + C(y,3) is solvable.at n=34A010330
- A B_2 sequence: a(n) = least value such that the sequence increases and pairwise sums of distinct terms are all distinct.at n=29A010672
- a(n) = floor(n*(n-1)*(n-2)/21).at n=30A011903
- arcsinh(arctanh(x)*sin(x))=2/2!*x^2+4/4!*x^4-10/6!*x^6+1160/8!*x^8...at n=3A012722
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=30A013583