Properties of the Number -6461

Four Hundred Sixty-One

Basics

Value: -6462 → -6461 → -6460

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 7 × 13 × 71

Divisors: 1, 7, 13, 71, 91, 497, 923, 6461

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1100100111101

Octal: -14475

Duodecimal: -38A5

Hexadecimal: -193d

Square: 41744521

Square Root: 80.38034585643433

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

Starting at n, a(n) is the difference of the number of times we revisit spots coming from positive spots and the number of times we revisit spots coming from negative spots according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away. A324685

Numbers n such that prime(n) == -1 (mod n). A45924

Generalized Stirling numbers, [n+2,n]_2. A1701

a(n) = number of strings of length n that can be obtained by starting with abc and repeatedly doubling any substring in place. A135473

a(n) = a(n-1) + a([n/2]) + 1, a(1) = 1. A102378

A statistic on orbital systems over n sectors: the number of orbitals with k restarts. A274880

Products of 3 distinct non-Sophie Germain primes. A157347

Numbers k such that prime(k+1) == 3 (mod k). A105288

Concentric 17-gonal numbers. A195047

a(0)=4, a(1)=0, a(2)=0, a(3)=3; thereafter a(n) = a(n-3) + a(n-4). A50443