8595
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14976
- Proper Divisor Sum (Aliquot Sum)
- 6381
- 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
- 4560
- Möbius Function
- 0
- Radical
- 2865
- Omega Function (Ω)
- 4
- 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
- 26
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- no
- Odd
- yes
Appears in sequences
- Fibonacci sequence beginning 5, 11.at n=15A022136
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (Fibonacci numbers).at n=20A024318
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (F(2), F(3), ...).at n=19A024322
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (F(2), F(3), F(4), ...).at n=18A024885
- a(n) = T(2n-1,n), where T is the array in A026098.at n=42A026102
- Odd numbers with only palindromic prime factors whose sum is palindromic (counted with multiplicity).at n=27A046356
- Numbers n such that the trinomial x^n + x + 1 is irreducible over GF(7).at n=11A058857
- Antidiagonal sums of square array A082025.at n=24A082190
- Numbers n such that 30*n+7, 30*n+11, 30*n+13, 30*n+17, 30*n+19 are consecutive primes.at n=12A089157
- Nearest integer to the space diagonal of the smallest (measured by the longest edge) primitive (gcd(a,b,c)=1) Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers). If the space diagonal is an integer then the Euler brick is called a "perfect cuboid". There are no known perfect cuboids.at n=12A141029
- Numbers k such that k^81*(k^81+1)+1 is prime.at n=40A153442
- Triangle, read by rows, that transforms diagonals in the table of coefficients of successive iterations of x+x^2+x^3 (cf. A166880).at n=40A166884
- Number of n X n symmetric binary matrices with each 1 adjacent to no more than 1 king-move neighboring 1.at n=5A191477
- The number of labeled biconnected squaregraphs with n vertices.at n=15A194093
- a(n) = Sum_{k=0..n} 2^k*p(k), where p(k) is the partition function A000041.at n=8A259400
- Numbers k such that [r[s*k]] - [s[r*k]] = -2, where r = sqrt(2), s=sqrt(3), and [ ] = floor.at n=41A259584
- Number of levels in all bargraphs having semiperimeter n (n>=2). A level in a bargraph is a maximal sequence of two or more adjacent horizontal steps; it is preceded and followed by either an up step or a down step.at n=9A273345
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 662", based on the 5-celled von Neumann neighborhood.at n=30A273390
- Numbers k such that (49*10^k - 139)/9 is prime.at n=17A295972
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n*b(n-2), where a(0) = 1, a(1) = 2, b(0) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.at n=13A296285