6732
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 19656
- Proper Divisor Sum (Aliquot Sum)
- 12924
- 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
- 1920
- Möbius Function
- 0
- Radical
- 1122
- Omega Function (Ω)
- 6
- 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
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 44
- 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 graphical partitions of biconnected graphs with n nodes.at n=7A007722
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t is A000201 (lower Wythoff sequence).at n=35A023866
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A000201 (lower Wythoff sequence).at n=34A024863
- a(n) = T(3n,n), where T is the array in A026268.at n=5A026293
- Longest edge a of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=15A031173
- Base 9 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,2.at n=4A037502
- a(n) = A033001(n)/4.at n=36A043307
- 12 times triangular numbers.at n=33A049598
- Numbers k such that phi(x) = k has exactly 10 solutions.at n=35A060673
- Even numbers k such that the central binomial coefficient A000984(k, k/2) is divisible by k^2.at n=4A080395
- Length of lists created by n substitutions k -> Range[k+1,-Abs[k],-2] starting with {1}.at n=11A084083
- a(n) = floor((1+2^n+3^n)/3).at n=9A087211
- Inverse Moebius transform of the shifted tetrahedral numbers.at n=29A116963
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+119)^2 = y^2.at n=23A129837
- Incorrect version of A154641 and A154645.at n=4A139472
- a(n) = 2*A094555(n).at n=9A140431
- 12 times hexagonal numbers: 12*n*(2*n-1).at n=17A143698
- Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of 2 n steps taken from {(-1, -1), (-1, 0), (-1, 1), (1, 0)}.at n=6A151341
- G.f. A(x) satisfies: A(x) = 1 + x*Sum_{n>=0} log( A(3^n*x) )^n / n!.at n=4A156904
- 4*P_5(n), 4 times the Legendre Polynomial of order 5 at n.at n=3A160737