Properties of the Number -331776

Three Hundred Thirty-One Thousand Seven Hundred Seventy-Six

Basics

Value: -331777 → -331776 → -331775

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ¹² × 3 ⁴

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: Yes

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010001000000000000

Octal: -1210000

Duodecimal: -140000

Hexadecimal: -51000

Square: 110075314176

Square Root: 576

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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

Determinant of the n X n matrix with (i,j)-entry (i,j = 0,...,n-1) equal to 1 or 0 according as n + i - j and n - i + j are both prime or not. A228623

Expansion of (1-x)/(1-2·x²+2·x³). A78025

Fourth powers: a(n) = n⁴. A583

Product of divisors of n. A7955

a(n) = (n!)ⁿ. A36740

a(n) = solution to the "Select All, Copy, Paste" problem: Given the ability to type a single letter, or to type individual "Select All", "Copy" or "Paste" command keystrokes, what is the maximal number of letters of text that can be obtained with n keystrokes? A178715

16-almost primes (generalization of semiprimes). A69277

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 2ⁿ-1 as Sum(k=0..n)T(n,k)*binomial(n,k). A244124

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 2ⁿ-1 as Sum(k=0..n)T(n,k)*binomial(n,k). A244126

Powers of 24: a(n) = 24ⁿ. A9968