9566
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14352
- Proper Divisor Sum (Aliquot Sum)
- 4786
- 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
- 4782
- Möbius Function
- 1
- Radical
- 9566
- 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 96.at n=20A031594
- Numerators of continued fraction convergents to sqrt(718).at n=6A042382
- Numbers k such that (1!)^2 + (2!)^2 + (3!)^2 + ... + (k!)^2 is prime.at n=17A100289
- Conjectured numbers n such that the trajectory of n as defined in A003508 is unique.at n=35A105233
- 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, -1), (-1, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=9A148723
- Integers of the form: 0/3 + 1/3 + 2/3 + 3/3 + 5/3 + 7/3 + 11/3 + 13/3 + 17/3 + ....at n=39A182155
- Smallest number m such that A210659(m)=n.at n=10A210660
- Number of runs of strictly increasing numbers of 2 X 2 squares in the list of partitions of n^2 into squares, where partition sorting order is ascending with larger squares taking higher precedence.at n=15A227940
- Number of partitions of n that sorted in increasing order contain a part k in position k for some k.at n=33A238395
- Number of superdiagonal partitions: partitions (p1, p2, p3, ...) of n such that pi >= i.at n=46A238873
- Sums of Pythagorean sextuples in increasing order: The sums of sets of six natural numbers which correspond to the lengths of the edges of a tetrahedron whose four faces are all different Pythagorean triangles.at n=11A248548
- Number of (n+2)X(n+2) 0..2 arrays with every 3X3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=2A252220
- Number of (n+2) X (3+2) 0..2 arrays with every 3 X 3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=2A252223
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=12A252228
- Number of (n+1) X (6+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101.at n=9A259220
- Numbers n such that the sum of the digits of the numbers from 0 to n is a square.at n=40A271626
- Numbers k such that A070313(k) = 2^k - (2*k+1) is a prime number.at n=11A344781
- Numbers that are the sum of five third powers in exactly nine ways.at n=36A345186
- Row sums of A376168.at n=43A376169
- Semiprimes s = A001358(k) such that k, s - k and s + k are also semiprimes.at n=35A383468