3626
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 6498
- Proper Divisor Sum (Aliquot Sum)
- 2872
- 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
- 1512
- Möbius Function
- 0
- Radical
- 518
- Omega Function (Ω)
- 4
- 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
- 17
- 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
- Smallest nonnegative number that is the sum of 3 squares in exactly n ways.at n=22A000437
- a(n) = (n + 3)*(n^2 + 6*n + 2)/6.at n=25A005286
- Number of convex polygons of length 2n on honeycomb, or EG-convex polyominoes.at n=12A006743
- Coordination sequence T2 for Zeolite Code GOO.at n=41A008112
- Coordination sequence T4 for Zeolite Code PAU.at n=44A008222
- Coordination sequence T2 for Zeolite Code iRON.at n=42A009882
- Fibonacci sequence beginning 1, 9.at n=14A022099
- Numbers that are the sum of 4 positive cubes in exactly 3 ways.at n=35A025405
- Numbers that are the sum of 4 positive cubes in 3 or more ways.at n=37A025407
- a(n) = Sum_{i=0..n, j=0..n} A026648(i,j).at n=10A026657
- a(n) = Sum_{k=floor((n+1)/2)..n} T(k,n-k); i.e., a(n) is the n-th diagonal sum of left-justified array T given by A026998.at n=19A027010
- Numbers whose set of base-12 digits is {1,2}.at n=25A032932
- Second pentagonal numbers with odd index: a(n) = (2*n-1)*(3*n-1).at n=25A033568
- Numbers of the form k*(k+1)/6 for k = 2 or 3 modulo 6.at n=49A036499
- Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 1.at n=17A042979
- Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 0.at n=17A042980
- Number of degree-n irreducible polynomials over GF(2) with trace = 1 and subtrace = 0.at n=17A042981
- Numbers whose base-5 representation contains exactly three 0's and two 1's.at n=37A045171
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=11A049959
- Numbers k such that 265*2^k + 1 is prime.at n=14A053349