Properties of the Number -8467

Four Hundred Sixty-Seven

Basics

Value: -8468 → -8467 → -8466

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 8467

Divisors: 1, 8467

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10000100010011

Octal: -20423

Duodecimal: -4A97

Hexadecimal: -2113

Square: 71690089

Square Root: 92.01630290334425

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(n) = ∑_k=1..n μ(k)*k³. A336277

Indices of prime Lucas numbers. A1606

Primes from merging of 4 successive digits in decimal expansion of the Golden Ratio, (1+sqrt(5))/2. A103810

Primes of the form k² + 3. A49423

Number of non-strict integer partitions of n with at least one part of odd multiplicity that is not the first or last. A349796

Smallest prime p(k) such that the number of distinct prime divisors of all composite numbers between p(k) and p(k+1) is n. A75580

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique value such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 3. A50032

a(n) = a(n-1) + a(m) for n >= 3, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = 2. A50048

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = a(3) = 3. A50064

Mother primes of order 8. A136067