4366
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6840
- Proper Divisor Sum (Aliquot Sum)
- 2474
- 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
- 2088
- Möbius Function
- -1
- Radical
- 4366
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 139
- 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
- Coordination sequence T12 for Zeolite Code MFI.at n=42A008164
- Number of ordered quadruples of integers from [ 1,n ] with no common factors between triples.at n=18A015635
- a(n) = position of 3*(n^2) in A000408.at n=41A024800
- From hexagons in a circle problem.at n=3A028231
- G.f.: A(x) = (1/2)*x*(B(x)^2+B(x^2)), where B(x) = g.f. for A000600.at n=18A036674
- Coordination sequence T9 for Zeolite Code STT.at n=44A038424
- Numbers whose base-7 representation contains exactly three 5's.at n=34A043415
- Coordination sequence T4 for Zeolite Code ISV.at n=46A047961
- Number of nonprimes <= prime(n)^2.at n=19A053683
- Numbers k such that x^k + x^5 + 2 is irreducible over GF(3).at n=17A058238
- Number of rooted identity (asymmetric) planar trees that can be turned over.at n=10A066317
- Zero-based position of the least significant (rightmost) zero bit in the bit-masks A068222 (A068224).at n=47A068058
- Rounded volume of a regular octahedron with edge length n.at n=21A071400
- Poincaré series [or Poincare series] (or Molien series) for a certain five-fold wreath product P_5.at n=34A091726
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 37 and 59, the first two irregular primes.at n=17A092231
- Write the natural numbers as an infinite sequence of digits, starting at the left; a(n) is the subset (i.e., the position in this sequence of the "counting digits") of the first digit of the n-th square.at n=36A105314
- Numbers that are the least element of a k-cycle (k > 1) of permutation A114650.at n=40A114727
- Number of even parts in all partitions of n into distinct parts.at n=44A116680
- Number of partitions of n such that the least part occurs at least twice.at n=29A117989
- Having specified two initial terms, the "Half-Fibonacci" sequence proceeds like the Fibonacci sequence, except that the terms are halved before being added if they are even.at n=27A120424