1064
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 2400
- Proper Divisor Sum (Aliquot Sum)
- 1336
- 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
- 432
- Möbius Function
- 0
- Radical
- 266
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 31
- 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
- Triangle giving number L(n,k) of normalized k X n Latin rectangles.at n=17A001009
- Number of 3 X n reduced (normalized) Latin rectangles.at n=3A001623
- Triangular numbers plus quarter-squares: n*(n+1)/2 + floor((n+1)^2/4) (i.e., A000217(n) + A002620(n+1)).at n=37A001859
- Absolute value of Glaisher's alpha(n).at n=7A002290
- Numbers that are the sum of 2 positive cubes.at n=45A003325
- Numbers that are the sum of 10 positive 5th powers.at n=42A003355
- a(n) = floor(n*phi^9), where phi is the golden ratio, A001622.at n=14A004924
- a(n) = round(n*phi^9), where phi is the golden ratio, A001622.at n=14A004944
- Partitioning integers to avoid arithmetic progressions of length 3.at n=16A006999
- Expansion of (1+x^2)/((1-x)^2*(1-x^3)).at n=55A007980
- Coordination sequence T1 for Zeolite Code AFS.at n=25A008023
- Coordination sequence T1 for Zeolite Code MTT.at n=20A008189
- Coordination sequence T4 for Zeolite Code -PAR.at n=23A009858
- Coordination sequence T8 for Zeolite Code TER.at n=22A016440
- Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(2,6).at n=6A018915
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite RSN = RUB-17 K4Na12[Zn8Si28O72].18H2O starting with a T3 atom.at n=10A019221
- a(n) = 3*a(n-1) - a(n-2) + 2*a(n-3) - 2*a(n-4).at n=6A019487
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly seven 1's.at n=7A020443
- Least k such that b(k) = n, where b( ) is sequence A020944.at n=39A020948
- n-th 8k+3 prime plus n-th 8k+5 prime.at n=25A022763