1492
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 2618
- Proper Divisor Sum (Aliquot Sum)
- 1126
- 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
- 744
- Möbius Function
- 0
- Radical
- 746
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 21
- 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
- A Fielder sequence. a(n) = a(n-1) + a(n-3) + a(n-4) + a(n-5), n >= 6.at n=13A001639
- a(n) = ceiling(1000*log_10(n)).at n=30A004227
- a(n) = A259095(2n,n).at n=15A005575
- Maxima of the rows of the triangle A259095.at n=31A005577
- Witt vector *2!.at n=7A006173
- Discriminants of totally real cubic fields.at n=43A006832
- Exponent of least power of 2 having n consecutive 0's in its decimal representation.at n=6A006889
- Number of partitions of n into parts of sizes {a( )} is a(n).at n=36A007209
- For any circular arrangement of 0..n-1, let S = sum of squares of every sum of two contiguous numbers; then a(n) = # of distinct values of S.at n=20A007773
- Coordination sequence T2 for Zeolite Code LTL.at n=28A008139
- Coordination sequence T2 for Zeolite Code MTT.at n=24A008190
- Molien series for A_5.at n=35A008628
- Coordination sequence for sigma-CrFe, Position Xd.at n=10A009959
- Expansion of 1/(1-x^2-x^3-x^4-x^5-x^6-x^7-x^8-x^9).at n=18A013986
- Expansion of 1/(1-x^7-x^8-x^9-x^10-x^11-x^12).at n=49A017861
- Number of lines through at least 2 points of an n X n grid of points.at n=9A018808
- Number of lines through exactly 6 points of an n X n grid of points.at n=34A018813
- Squares on infinite chessboard at n moves from center using a {2,3} fairy knight.at n=23A018839
- Numbers k such that the continued fraction for sqrt(k) has period 18.at n=46A020357
- Length of n-th term of A006711.at n=25A022476