Properties of the Number -6433

Four Hundred Thirty-Three

Basics

Value: -6434 → -6433 → -6432

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 7 × 919

Divisors: 1, 7, 919, 6433

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1100100100001

Octal: -14441

Duodecimal: -3881

Hexadecimal: -1921

Square: 41383489

Square Root: 80.20598481410225

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 k such that the concatenation of k with k+8 gives a square. A115429

a(1) = 1; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A74336

Number of proper divisors of n-th even perfect number. A133033

T(n,k)=Number of length n+1 0..k arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero. A250419

a(0)=1; a(n) = 3ⁿ - 2^n-1 for n >= 1. A83313

T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places including 0. A222345

a(n) = floor(2ⁿ*π). A68425

T(n,k) = number of n X k 0..2 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1) X (k+1) 0..2 array without adjacent equal elements in the latter. A229521

Fold a square sheet of paper alternately vertically to the left and horizontally downwards; after each fold, draw a line along each inward crease; after n folds, the resulting graph has a(n) regions. A342759

Semiprimes that are the sum of the first n semiprimes for some n. A92190