1330
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 2880
- Proper Divisor Sum (Aliquot Sum)
- 1550
- 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
- 1
- Radical
- 1330
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 52
- 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
- Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.at n=19A000292
- a(n) = 1^2 + 3^2 + 5^2 + 7^2 + ... + (2*n-1)^2 = n*(4*n^2 - 1)/3.at n=10A000447
- Number of compositions of n into 5 ordered relatively prime parts.at n=11A000743
- Numbers k such that phi(k) = phi(k+2).at n=27A001494
- Number of bipartite partitions.at n=10A002766
- "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=23A004210
- Binomial coefficient C(3n,n-4).at n=3A004322
- Binomial coefficient C(7n,n).at n=3A004368
- Expansion of (1-x+x^2)/((1-x)^2*(1-x^2)*(1-x^4)).at n=37A005232
- x^3 + n*y^3 = 1 is solvable.at n=32A005988
- Primitive pseudoperfect numbers.at n=22A006036
- Dodecahedral numbers: a(n) = n*(3*n - 1)*(3*n - 2)/2.at n=7A006566
- Number of nonsplit type 2 metacyclic 2-groups of order 2^n.at n=47A007981
- Coordination sequence T2 for Zeolite Code AFO.at n=24A008016
- Coordination sequence T2 for Zeolite Code EMT.at n=30A008087
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^4)).at n=36A008804
- "Pascal sweep" for k=8: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=56A009522
- "Pascal sweep" for k=10: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=49A009550
- Coordination sequence T4 for Zeolite Code -CLO.at n=32A009853
- Expansion of Product (1 - x^k)^10 in powers of x.at n=33A010818