8662
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13392
- Proper Divisor Sum (Aliquot Sum)
- 4730
- 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
- 4200
- Möbius Function
- -1
- Radical
- 8662
- 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
- 127
- 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
- Least number k such that k has n anti-divisors.at n=39A066464
- Number of anti-divisors of n (A066272) sets a record.at n=22A073638
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1, a(n+1)>a(n) and x=5/4.at n=42A080198
- a(n) = round( (sqrt n)^(sqrt n) ).at n=28A094054
- a(n) = floor(sqrt(n)^sqrt(n)).at n=28A094092
- Sum of the squares of the first n squarefree numbers.at n=22A111715
- a(n) = (2^(semiprime(n)-1)) modulo (semiprime(n)^2).at n=35A115948
- Alkane systems (see Cyvin reference for precise definition).at n=11A121188
- a(n) is the least triprime T for which the Mertens function M(T) = n.at n=29A123174
- Numbers n such that n^3 is zeroless pandigital.at n=39A124628
- 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, 0), (-1, 1, -1), (0, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=8A149929
- Number of perfect powers with distinct digits in base n.at n=11A159078
- Number of different fixed (possibly) disconnected trominoes bounded tightly by an n X n square.at n=38A163433
- Number of binary strings of length n with no substrings equal to 0000, 0001, or 1100.at n=16A164415
- Start with 3. If a, b in sequence, so is ab+1.at n=31A180432
- Super anti-abundant numbers.at n=22A192269
- Number of 2Xn 0..1 arrays with row sums equal and column sums unequal to adjacent columns.at n=10A202743
- Number of 10's in the last section of the set of partitions of n.at n=50A206560
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210859; see the Formula section.at n=58A210858
- Slowest-growing sequence of 3-almost primes (trientprimes) where 1/(tp+1) sums to 1 without actually reaching it.at n=110A226527