8678
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 6
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13020
- Proper Divisor Sum (Aliquot Sum)
- 4342
- 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
- 4338
- Möbius Function
- 1
- Radical
- 8678
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 78
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- 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=18A031590
- Number of dyslexic identity rooted planar trees with n nodes.at n=12A032102
- "CIK" (necklace, indistinct, unlabeled) transform of 1,2,3,4,...at n=11A032198
- a()=A037260 and its first [ A037261 ], 2nd [ A037262 ] and 3rd [ A037263 ] differences together include every number at most once and are monotonic and minimal.at n=17A037260
- Numbers with multiplicative persistence value 6.at n=6A046515
- Numbers k such that k^512 + 1 is prime.at n=24A057465
- Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs of consecutive 0's (0<=k<=ceiling(n/2)).at n=31A119808
- Number of primes between (prime(n + 1))^Pi and (prime(n))^Pi.at n=25A137380
- Composite numbers whose multiplicative persistence is 6.at n=6A199996
- Total sum of the numbers of partitions with positive k-th ranks of all partitions of n.at n=24A208479
- Number of (n+1)X(2+1) 0..2 arrays with the difference of the upper median and minimum value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise.at n=1A235585
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the difference of the upper median and minimum value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise.at n=4A235588
- Number of 2Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=13A240154
- Number of partitions p of n such that (number of even numbers in p) > (number of odd numbers in p).at n=39A241640
- Expansion of Product_{k>=1} ((1 - 2*x^k)/(1 + 2*x^k))^(1/2).at n=16A303345
- Partial sums of A304076.at n=40A304078
- Number of maximal subsets of {1..n} containing no quotients of pairs of distinct elements.at n=42A326492
- Number of maximal subsets of {1..n} containing no quotients of pairs of distinct elements.at n=43A326492
- Number of partitions of n with rank congruent to 1 mod 3.at n=37A328989
- a(n) is the least positive integer that can be expressed as the sum of a prime number and a perfect power in exactly n ways.at n=34A365294