1496
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 3240
- Proper Divisor Sum (Aliquot Sum)
- 1744
- 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
- 640
- Möbius Function
- 0
- Radical
- 374
- 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
- 47
- 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
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=16A000330
- Generalized octagonal numbers: k*(3*k-2), k=0, +- 1, +- 2, +-3, ...at n=44A001082
- A Fielder sequence: a(n) = a(n-1) + a(n-2) + a(n-4).at n=12A001641
- The coding-theoretic function A(n,4,4).at n=30A001843
- Triangular numbers plus quarter-squares: n*(n+1)/2 + floor((n+1)^2/4) (i.e., A000217(n) + A002620(n+1)).at n=44A001859
- Record values in A005210.at n=42A005211
- 4-dimensional analog of centered polygonal numbers: a(n) = n(n+1)*(n^2+n+4)/12.at n=11A006007
- a(n) = binomial(n+3, 3)/4 for odd n, n*(n+2)*(n+4)/24 for even n.at n=31A006918
- Coordination sequence T3 for Zeolite Code MFS.at n=24A008175
- Coordination sequence T1 for Zeolite Code PHI.at n=28A008227
- Molien series of 4-dimensional representation of cyclic group of order 4 over GF(2) (not Cohen-Macaulay).at n=31A008610
- Molien series for A_6.at n=31A008629
- Expansion of (1+x^5)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=45A008766
- a(n) = 2*a(n-1) + a(n-4).at n=10A008999
- Numbers k such that the geometric mean of phi(k) and sigma(k) is an integer.at n=22A011257
- a(n) = floor(n*(n-1)*(n-2)/24).at n=34A011842
- a(n) = floor(binomial(n,4)/4).at n=21A011850
- Even square pyramidal numbers.at n=7A015222
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MTT = ZSM-23 Nan[AlnSi24-nO48] starting with a T5 atom.at n=10A019190
- Ordered areas (divided by 6) of primitive Pythagorean triangles (with multiple entries).at n=44A020885