6738
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13488
- Proper Divisor Sum (Aliquot Sum)
- 6750
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2244
- Möbius Function
- -1
- Radical
- 6738
- Omega Function (Ω)
- 3
- 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
- 181
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Shallit sequence S(14,23), a(n)=[ a(n-1)^2/a(n-2)+1 ].at n=12A010923
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 82.at n=1A031580
- Denominators of continued fraction convergents to sqrt(115).at n=12A041209
- Number of partitions of n with parts (with repetitions) forming a division lattice (i.e., closed under GCD and LCM).at n=56A051839
- n times n+8 gives the concatenation of two numbers m and m+3.at n=2A116312
- "666" in bases 7 and higher rewritten in base 10.at n=26A121205
- Indices k such that A019326(k)=Phi[k](8) is prime, where Phi is a cyclotomic polynomial.at n=26A138938
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (0, -1, 1), (1, 0, -1), (1, 0, 0)}.at n=8A148888
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 1, 1), (1, 0, 0), (1, 1, -1)}.at n=7A150258
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (1, 0, 0), (1, 1, -1), (1, 1, 0)}.at n=7A150406
- Partial sums of Iccanobif numbers A001129.at n=13A172524
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209701; see the Formula section.at n=51A209702
- Periods associated with A217611.at n=29A217646
- Number of partitions of n+5 with largest inscribed rectangle having area <= n.at n=26A218626
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..4 array extended with zeros and convolved with 1,1,1.at n=18A222434
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 201", based on the 5-celled von Neumann neighborhood.at n=22A270722
- a(n) = Sum_{d|n} min(d, n/d)^5.at n=44A297795
- Partial sums of A301710.at n=49A301711
- Sum of the fourth largest parts of the partitions of n into 8 squarefree parts.at n=48A326449
- Triangle read by rows: T(n,k) is the number of sets of integer-sided rectangular pieces that can tile an n X k rectangle, 1 <= k <= n.at n=24A360629