1016
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
- 8
- Divisor Sum
- 1920
- Proper Divisor Sum (Aliquot Sum)
- 904
- 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
- 504
- Möbius Function
- 0
- Radical
- 254
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 49
- 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
- a(n) is the solution to the postage stamp problem with n denominations and 5 stamps.at n=9A001215
- G.f.: q * Product_{m>=1} (1-q^m)^8*(1-q^2m)^8.at n=7A002288
- a(n) = floor(n*phi^7), where phi is the golden ratio, A001622.at n=35A004922
- a(n) = round(n*phi^7), where phi is the golden ratio, A001622.at n=35A004942
- Number of symmetric, reduced unit interval schemes with n+1 intervals (n>=1).at n=17A005213
- 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=27A005282
- Coefficient of x^7 in expansion of (1+x+x^2)^n.at n=4A005715
- Construct triangle in which n-th row is obtained by expanding (1 + x + x^2)^n and take the next-to-central column.at n=7A005717
- a(n) = 6*n^2 + 2 for n > 0, a(0)=1.at n=13A005897
- Related to representations as sums of Fibonacci numbers.at n=18A006133
- a(n) = Sum_{k=1..n-1} (k OR n-k).at n=34A006583
- Discriminants of totally real cubic fields.at n=27A006832
- G.f.: Product_{k>=1} (1 + x^(2*k - 1)) / (1 - x^(2*k)).at n=30A006950
- Numbers k such that phi(x) = k has exactly 3 solutions.at n=40A007367
- Stella octangula numbers: a(n) = n*(2*n^2 - 1).at n=8A007588
- Number of point labeled reduced 5-free two-graphs with n nodes.at n=6A007834
- Coordination sequence T2 for Zeolite Code AEL.at n=21A008005
- Coordination sequence T1 for Zeolite Code AET.at n=22A008007
- Coordination sequence T3 for Zeolite Code AET.at n=22A008009
- Coordination sequence T1 for Zeolite Code MAZ.at n=22A008144