ℕ atory
Play Now

Properties of the Number -8463

Four Hundred Sixty-Three

Basics

Value: -8464 → -8463 → -8462

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 13 × 31

Divisors: 1, 3, 7, 13, 21, 31, 39, 91, 93, 217

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10000100001111

Octal: -20417

Duodecimal: -4A93

Hexadecimal: -210f

Square: 71622369

Square Root: 91.9945650568554

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

Riordan array (1-4x, x(1-x)3). A119305
Number of integer partitions of n with an alternating permutation. A345170
Number of sublattices of index n in generic 3-dimensional lattice. A1001
Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity). A39752
3 times octagonal numbers: a(n) = 3·n*(3·n-2). A152751
Squarefree integers m > 1 such that if prime p divides m, then the sum of the base p digits of m is at least p. A324315
T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 0 1 0 vertically. A207426
a(n) = 22^(n-1)*b(n) where b(1) = 1/2 and b(n+1) = b(n) - b(n)2. A76628
Squarefree integers m > 1 such that if prime p divides m, then sp(m) >= p and sp(m) == 3 (mod p-1), where sp(m) is the sum of the base p digits of m. A324405
a(n) = 16n2 + 32n + 15. A141759