8566
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12852
- Proper Divisor Sum (Aliquot Sum)
- 4286
- 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
- 4282
- Möbius Function
- 1
- Radical
- 8566
- 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
- 127
- 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
- Expansion of 1/((1-2x)(1-7x)(1-9x)(1-11x)).at n=3A028010
- 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=10A031590
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 64 ones.at n=8A031832
- a(n) = A048141(3*n+2).at n=50A051060
- Expansion of (1-x)/(1-2*x-x^3+x^4).at n=13A052540
- Let f(n) be 2n + POD(n) + 1 if n is even, otherwise 2n - POD(n) - 1, where POD(n) is the product of digits of n. Sequence gives smallest number requiring n iterations to reach a prime.at n=48A074808
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=32A090495
- Trajectory of 1001 under "3x+1" map.at n=15A100709
- Numbers k such that k and k^2 use only the digits 3, 5, 6, 7 and 8.at n=5A137132
- 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), (1, -1, -1), (1, 1, 1)}.at n=9A149079
- Indices of primes in the Padovan sequence A000931.at n=21A152870
- Number of n X 5 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=12A166808
- a(n) = n^3 mod (n-th prime squared).at n=41A167623
- Consider the ordered Goldbach partitions of the even numbers m. Then a(n) is the least m which contains prime(n) such partitions composed of odd primes.at n=42A216047
- Square roots of numbers in A238334.at n=41A238335
- Alternating sum of centered heptagonal pyramidal numbers.at n=24A270694
- Record numbers of unordered triples {a, b, c} of distinct positive integers from 1 to n such that a*b = c*n.at n=41A292430
- Numbers k such that (7*10^k + 167)/3 is prime.at n=15A293758
- Expansion of (1/(1 - x))*Product_{k>=1} 1/(1 - k*x^k).at n=13A302830
- Number of ways to tile a hexagonal strip made up of n equilateral triangles, using singles and triples.at n=20A365352