8487
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
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 4617
- 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
- 5280
- Möbius Function
- 0
- Radical
- 2829
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 140
- 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
- Least term in period of continued fraction for sqrt(n) is 8.at n=25A031432
- Lucky numbers that are decimal concatenations of n with n + 3.at n=11A032653
- Triangle of numerators of coefficients of Faulhaber polynomials used for sums of even powers.at n=40A093558
- a(1) = 1, a(n) = digit reversal of n*a(n-1).at n=7A096138
- Number of partitions p of n for which Odd(p) = Odd(p') (mod 4), where p' is the conjugate of p.at n=38A097566
- a(n) = 16n^2 + n.at n=22A157474
- a(n) = 529*n^2 + 23.at n=4A158631
- a(n) = n*(2 + 5*n).at n=41A168668
- Numbers k such that k^2 + 1 is divisible by precisely five distinct primes where the sum of the largest and the smallest is equal to the sum of the other three.at n=2A192771
- Numbers k such that the sum of the largest and the smallest prime divisor of k^2 + 1 equals the sum of the other distinct prime divisors.at n=5A199924
- Number of nondecreasing sequences of n 1..6 integers with no element dividing the sequence sum.at n=25A212866
- a(n) = (A216363(n) - 1)/118.at n=12A216380
- Nonsquare k such that the minimal (in y) solution 0 < y < x of x^2 - k*y^2 = 1 has x-y square.at n=44A225946
- Number of cubic graphs on 2n unlabeled nodes whose connected components are vertex-transitive.at n=22A241167
- Number of n X 4 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=5A252979
- Number of nX6 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=3A252981
- T(n,k)=Number of nXk nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=39A252983
- T(n,k)=Number of nXk nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=41A252983
- Number of set partitions of [n] such that for each block b the smallest integer interval containing b has at most five elements.at n=10A276721
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) - 1, where a(0) = 1, a(1) = 4, b(0) = 2, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=15A295964