Properties of the Number -62368

Sixty-Two Thousand Three Hundred Sixty-Eight

Basics

Value: -62369 → -62368 → -62367

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁵ × 1949

Divisors: 1, 2, 4, 8, 16, 32, 1949, 3898, 7796, 15592

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111001110100000

Octal: -171640

Duodecimal: -30114

Hexadecimal: -f3a0

Square: 3889767424

Square Root: 249.73586046060746

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

T(n,k)=Number of nXk binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally. A228660

Let f(n) = minimum of average number of comparisons needed for any sorting method for n elements and let g(n) = n!*f(n). Sequence gives a lower bound on g(n). A117627

Triangle of coefficients of generating function of 4-ary rooted trees of height at most n. A36606

Number of 4-ary rooted trees with n nodes and height at most 4. A36609

Number of 4-ary rooted trees with n nodes and height exactly 4. A36628

Number of nX7 binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally. A228659

Number of 4 X n binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally. A228663

a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026703. A26711