2080
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 5292
- Proper Divisor Sum (Aliquot Sum)
- 3212
- 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
- 768
- Möbius Function
- 0
- Radical
- 130
- Omega Function (Ω)
- 7
- 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
- yes
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- Number of ways of writing n as a sum of 6 squares.at n=12A000141
- Series-parallel numbers.at n=5A000163
- Numbers that are the sum of 2 squares but not sum of 3 nonzero squares.at n=40A000549
- Number of compositions of n into 4 ordered relatively prime parts.at n=22A000742
- a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3), n > 3, with a(0)=a(1)=a(2)=0, a(3)=1.at n=13A000749
- Relational systems on n nodes.at n=1A001375
- a(n) = (2^n + 2^[ n/2 ] )/2.at n=10A001445
- a(n) = (4^n + 4^[ n/2 ] )/2.at n=4A001446
- Let F(x) = 1 + x + 4x^2 + 10x^3 + ... = g.f. for A000293 (solid partitions) and expand (1-x)(1-x^2)(1-x^3)...*F(x) in powers of x.at n=11A002836
- Numbers that are the sum of 3 positive 5th powers.at n=17A003348
- a(n) = 2^(n-1)*( 2^n + (-1)^n ).at n=6A003665
- a(n) = ceiling(1000*log(n)).at n=7A004242
- Binomial coefficient C(5n,n-11).at n=2A004353
- Numbers that are the sum of at most 3 positive 5th powers.at n=32A004843
- Number of (n-1)-bead black-white reversible strings; also binary grids; also row sums of Losanitsch's triangle A034851; also number of caterpillar graphs on n+2 vertices.at n=12A005418
- 4-dimensional analog of centered polygonal numbers: a(n) = n(n+1)*(n^2+n+4)/12.at n=12A006007
- Nonperiodic autocorrelation functions of length n.at n=12A006606
- a(n) = 2^(n-1)*(1+2^n).at n=6A007582
- 9-gonal (or enneagonal) pyramidal numbers: a(n) = n*(n+1)*(7*n-4)/6.at n=12A007584
- Coordination sequence T2 for Zeolite Code FER.at n=28A008107