Properties of the Number 8675

Eight Thousand Six Hundred Seventy-Five

Basics

Value: 8674 → 8675 → 8676

Parity: odd

Prime: No

Previous Prime: 8669

Next Prime: 8677

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 ² × 347

Divisors: 1, 5, 25, 347, 1735, 8675

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10000111100011

Octal: 20743

Duodecimal: 502B

Hexadecimal: 21e3

Square: 75255625

Square Root: 93.13968005098579

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Iccanobirt numbers (15 of 15): a(n) = R(R(a(n-1)) + R(a(n-2)) + R(a(n-3))), where R is the digit reversal function A004086. A102125

Total number of positive integers below 10ⁿ requiring 9 positive biquadrates in their representation as sum of biquadrates. A186663

a(n) = n*(14·n-3). A185019

Number of digraphs with a source and a sink on n unlabeled nodes. A49531

Lexicographically first sequence of distinct terms such that any set of three successive digits can be reordered as {d, d+1, d+2}, d being the smallest of the three digits. A302173

Number of partitions in expanding space. A23879

Consider the Diophantine equation x³ + y³ = z³ - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y. A50789

Total number of sequences with c_j copies of j and longest increasing subsequence of length k summed over all compositions [c₁, c₂, ..., c_k] of n into distinct parts. A268701

G.f. satisfies A(x) = 1 + x·A(x)³ + x²*A(x)⁸. A364478

a(n) = 2·a(n-1) + a(floor(n/2)), with a(1) = 1, a(2) = 2. A33490