8466
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
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 9678
- 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
- 2624
- Möbius Function
- 1
- Radical
- 8466
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 202
- Smith Number
- yes
- 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
- Number of points on surface of octahedron; also coordination sequence for cubic lattice: a(0) = 1; for n > 0, a(n) = 4n^2 + 2.at n=46A005899
- Coordination sequence for C_3 lattice: a(n) = 16*n^2 + 2 (n>0), a(0)=1.at n=23A010006
- Numbers k such that k^2 is palindromic in base 16.at n=21A029733
- 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 92.at n=0A031590
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 92.at n=1A031770
- Numbers whose set of base-16 digits is {1,2}.at n=23A032936
- Base-4 palindromes that start with 2.at n=46A043004
- Honaker's triangle problem: form a triangle with base of length n, all entries different, all row sums equal; a(n) gives minimal row sum.at n=37A047837
- a(n) = max_{r=1..n-1} ceiling(t(t(n)-t(r-1))/(n-r+1)), where t() = triangular numbers A000217.at n=37A047873
- Number of asymmetric (identity) trees with n nodes and 4 leaves.at n=31A055335
- Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.at n=38A058229
- Solutions to phi(x + omega(x)) = phi(x) + d(x), where phi() = A000010(), d() = A000005() and omega() = A001221().at n=5A063868
- Basis for code in A075928.at n=8A075929
- Expansion of 1/((1-x)*(1-x^2)*(1-x^3)*(1-x^4))^2.at n=21A117486
- a(1) = 2, a(2) = 2, a(3) = 1, a(n) = a(n-3) + floor(a(n-2)/2) for n >= 4.at n=59A130816
- Numbers n for which abs((-1)^k*Sum_{k=1..n} ((n-k+1) mod k)) = 0.at n=8A154586
- Multiples of 17 whose reversal - 1 is also a multiple of 17.at n=30A166398
- A symmetrical sum triangle sequence:a(n)=vector(a(n-1)).Reverse(vector(a(n-1));a(0)=1;a(1)=2;t(n,m)=2+a(n)-a(m)-a(n-m).at n=40A176698
- Inverse permutation to A190130.at n=42A190131
- a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is a triangular number.at n=29A214961