Properties of the Number -463680

Four Hundred Sixty-Three Thousand Six Hundred Eighty

Basics

Value: -463681 → -463680 → -463679

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁶ × 3 ² × 5 × 7 × 23

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1110001001101000000

Octal: -1611500

Duodecimal: -1A4400

Hexadecimal: -71340

Square: 214999142400

Square Root: 680.9405260373331

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

Dirichlet convolution of Ramanujan numbers (A000594) with themselves. A34778

a(n+2) = (2n+3)*a(n+1) + (n+1)²*a(n), a(0) = 1, a(1) = 1. A12244

Triangle read by rows where T(n,k) is the number of labeled loop-graphs on n vertices with k loops and n-k non-loops such that it is possible to choose a different vertex from each edge. A368924

Square array whose entry A(n,k) is the number of endofunctions on a set of size n with preimage constraint {0,1,...,k}, for n >= 0, k >= 0, read by descending antidiagonals. A306800

A Galton triangle: T(n,k) = 2·k*T(n-1,k) + (2·k-1)*T(n-1,k-1). A187075

Fibonacci sequence beginning 0, 10. A22093

a(n) = a(n-1) + 2·a(n-2) - a(n-3) - a(n-4), a(0)=0, a(1)=8, a(2)=10, a(3)=18. A153382

Positive numbers differing from next 3 greater squares by squares. A218487

Expansion of e.g.f. 1 / (exp(-x³) - x). A375607

n! times sum of Farey fractions of order n. A93593