Properties of the Number 8002

Eight Thousand Two

Basics

Value: 8001 → 8002 → 8003

Parity: even

Prime: No

Previous Prime: 7993

Next Prime: 8009

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 4001

Divisors: 1, 2, 4001, 8002

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1111101000010

Octal: 17502

Duodecimal: 476A

Hexadecimal: 1f42

Square: 64032004

Square Root: 89.45389874119518

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

a(0) = 1, a(n) = 5·n² + 2 for n>0. A10001

a(n) = (9·n² + 3·n + 2)/2. A38764

Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base. A60879

The second rank moment function N₂(n). A220908

Numbers k such that Fibonacci(prime(k)) is prime. A119984

a(n) = n³ + 2. A84380

Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,5,11, Q starts with 4,6, R starts with 2; at each stage the smallest number not yet present in P,Q,R is appended to R; every number appears exactly once in the union of P,Q,R. Sequence gives P. A225376

Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with upper domination number k. A332403

Greatest number having exactly n representations as ab+ac+bc with 0 < a < b < c. A94377

Number of (not necessarily connected) simple bridgeless graphs with n nodes. A263914