8508
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19880
- Proper Divisor Sum (Aliquot Sum)
- 11372
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2832
- Möbius Function
- 0
- Radical
- 4254
- 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
- 78
- 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
- yes
- Odd
- no
Appears in sequences
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).at n=44A052477
- Low-temperature partition function expansion for square lattice (Potts model, q=4).at n=15A057381
- Numbers k such that k^k + k - 1 is prime.at n=7A058912
- Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.at n=15A063058
- Expansion of ((eta(q)eta(q^15))/(eta(q^3)eta(q^5)))^3 in powers of q.at n=50A095123
- Number of 8X8 arrays of squares of integers, symmetric under 90 degree rotation, with all rows summing to n.at n=17A156397
- Number of one-sided polydrafters with n cells.at n=6A217720
- Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 2 4 6 or 7.at n=1A252555
- T(n,k) = Number of (n+2) X (k+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 1 2 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 1 2 4 6 or 7.at n=16A252558
- Number of (2+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 1, 2, 4, 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 1, 2, 4, 6 or 7.at n=4A252560
- Number of length n+2 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=34A255993
- Total number of left-to-right maxima in all compositions of n.at n=13A336482
- G.f. A(x) satisfies: A(x) = Sum_{n>=0} (n+1) * x^n / (1 - x^(n+1)*A(x))^3.at n=5A340358
- a(n) is the number of primes between (prime(n))^3 and (prime(n+1))^3.at n=24A365767