Properties of the Number -640096

Six Hundred Forty Thousand Ninety-Six

Basics

Value: -640097 → -640096 → -640095

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁵ × 83 × 241

Divisors: 1, 2, 4, 8, 16, 32, 83, 166, 241, 332

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10011100010001100000

Octal: -2342140

Duodecimal: -26A514

Hexadecimal: -9c460

Square: 409722889216

Square Root: 800.0599977501687

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

Numbers that are primitive non-deficient, but not primitive Zumkeller. A378656

Numbers that are abundant (A005101) and have no Zumkeller divisors. A376879

Triangle read by rows: T(n,k) is the number of L-convex polyominoes of semiperimeter n, having k maximal rectangles (n >= 2, 1 <= k <= floor(n/2)). An L-convex polyomino is a convex polyomino in which any two cells can be connected by a path internal to the polyomino and which has at most 1 change of direction (i.e., one of the four orientations of the letter L). A maximal rectangle in an L-convex polyomino P is a rectangle included in P that is maximal with respect to inclusion. A181368

A primitive semiperfect number k is in this sequence if and only if there exists exactly one subset S of the proper divisors of k with Sum(S) = k and 1 not in S. A392913