1310
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2376
- Proper Divisor Sum (Aliquot Sum)
- 1066
- 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
- 520
- Möbius Function
- -1
- Radical
- 1310
- Omega Function (Ω)
- 3
- 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
- 145
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=33A000064
- a(n) = a(n-1) + n * a(n-2), where a(1) = 1, a(2) = 2.at n=7A001475
- Numbers k such that 11*2^k - 1 is prime.at n=10A001772
- a(n) = (n + 3)*(n^2 + 6*n + 2)/6.at n=17A005286
- Number of column-convex polyominoes with perimeter n.at n=5A006026
- a(n) = 1 + n/2 + 9*n^2/2.at n=17A006137
- Self-convolution of numbers of preferential arrangements.at n=5A006957
- Number of partitions of n into parts of sizes {a( )} is a(n).at n=35A007209
- Integers written in factorial base.at n=44A007623
- From a problem in AI planning: a(n) = 4+a(n-1)+a(n-2)+a(n-3)+a(n-4)-a(n-5)-a(n-6)-a(n-7), n>7.at n=11A007800
- Coordination sequence T1 for Zeolite Code APD.at n=24A008034
- Coordination sequence T3 for Zeolite Code ATS.at n=26A008040
- Coordination sequence T10 for Zeolite Code MFI.at n=23A008162
- Coordination sequence T1 for Zeolite Code NES.at n=23A008205
- Coordination sequence T4 for Zeolite Code RTH.at n=25A009896
- a(n) = floor(n*(n-1)*(n-2)/15).at n=28A011897
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/25 ).at n=15A011935
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite BOG = Boggsite Na4Ca7[Al18Si78O192].74H2O starting with a T3 atom.at n=10A019081
- Coordination sequence T4 for Zeolite Code CGF.at n=25A019454
- Numbers k such that the continued fraction for sqrt(k) has period 18.at n=38A020357