8682
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
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17376
- Proper Divisor Sum (Aliquot Sum)
- 8694
- 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
- 2892
- Möbius Function
- -1
- Radical
- 8682
- 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
- 47
- 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
- Number of n-step spirals on cubic lattice.at n=8A006779
- Number of loopless multigraphs on infinite set of nodes with n edges.at n=9A050535
- Numbers which are the sum of their proper divisors containing the digit 4.at n=13A059463
- Integers k such that prime(k)-1 == 0 (mod phi(k)) where prime(n)=A000040(n) is the n-th prime and phi(n)=A000010(n) is the Euler totient function.at n=49A066936
- Number of compositions (ordered partitions) of n with designated summands.at n=12A091601
- Let p(k) be the number of partitions of k (A000041); a(n) = Sum_{1<=k<=n, gcd(k,n)=1} p(k).at n=26A096223
- Number of perfectly orderable perfect graphs on n nodes.at n=7A123447
- Number of slightly triangulated perfect graphs on n nodes.at n=7A123455
- Number of strongly perfect perfect graphs on n nodes.at n=7A123461
- Number of partitions of n into "number of partitions of n into partition numbers" numbers.at n=44A130898
- Numbers n such that primorial(n)/2 - 16 is prime.at n=23A139444
- 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, 0), (1, 1, -1)}.at n=8A148902
- Number of line segments connecting exactly 10 points in an n x n grid of points.at n=37A177726
- Triangle read by rows: Partial row sums of A181853(n,k).at n=33A181854
- A255298(2^n-1).at n=7A255299
- Coordination sequence for "crs" 3D uniform tiling formed from tetrahedra and truncated tetrahedra.at n=40A299268
- Array read by antidiagonals: A(n,k) is the number of nonequivalent binary matrices with k columns and any number of nonzero rows with n ones in every column up to permutation of rows and columns.at n=68A331461
- Number of integers in base n having exactly three distinct digits such that the number formed by the consecutive subsequence of the initial j digits is divisible by j for all j in {1,2,3}.at n=39A333405
- Number of solutions to +-2 +- 3 +- 5 +- 7 +- ... +- prime(n) = 0 or 1.at n=21A350404
- Maximal coefficient of (1 + x^2) * (1 + x^3) * (1 + x^5) * ... * (1 + x^prime(n)).at n=21A350457