ℕ atory
Play Now

Properties of the Number -314928

Three Hundred Fourteen Thousand Nine Hundred Twenty-Eight

Basics

Value: -314929 → -314928 → -314927

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 4 × 3 9

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001100111000110000

Octal: -1147060

Duodecimal: -132300

Hexadecimal: -4ce30

Square: 99179645184

Square Root: 561.1844616523163

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

Number of invertible 2 X 2 matrices mod n. A252
Numbers k such that Sumi ( e(i)/p(i) ) is an integer, where the prime factorization of k is Producti ( p(i)e(i) ). A72873
"Second factorials": ∏k=1..n kk2. A51675
Number of the Lipschitz quaternions in a reduced system modulo n. A227499
T(n,k)=Petersen graph (8,2) coloring a rectangular array: number of nXk 0..15 arrays where 0..15 label nodes of a graph with edges 0,1 0,8 8,14 8,10 1,2 1,9 9,15 9,11 2,3 2,10 10,12 3,4 3,11 11,13 4,5 4,12 12,14 5,6 5,13 13,15 6,7 6,14 7,0 7,15 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph. A223692
T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once. A269289
Number of isolated 0's in all ternary words of length n on {0,1,2}. A120926
Numbers k that, when expressed in base 6 and then interpreted in base 9, give a multiple of k. A62939
Number of permutations of 8 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum. A159739
Triangle read by rows: T(0,0) = 1; T(n,k) = 3·T(n-1,k) - 2·T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0. Triangle of coefficients of Fermat polynomials. A303941