Properties of the Number -316251

Three Hundred Sixteen Thousand Two Hundred Fifty-One

Basics

Value: -316252 → -316251 → -316250

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 13 × 17 × 53

Divisors: 1, 3, 9, 13, 17, 27, 39, 51, 53, 117

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001101001101011011

Octal: -1151533

Duodecimal: -133023

Hexadecimal: -4d35b

Square: 100014695001

Square Root: 562.3619830678457

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

a(n) = Sum_i=1..n binomial(i+2,3)² [ Sequential sums of the tetragonal numbers or "tetras" (pyramidal, square) raised to power 2 (drawn from the 4th diagonal - left or right - of Pascal's Triangle) ]. A86020

Binomial coefficients C(2·n+4,4). A53134

a(n) = binomial(10·n+5,n)/(2·n+1). A234528

Triangle, read by rows, where T(n,k) = C( C(n+2,3) - C(k+2,3) + 2, n-k) for n>=k>=0. A126454

a(n) = A001512(n)/24 = (5·n+1)*(5·n+2)*(5·n+3)*(5·n+4)/24. A151989

Binomial coefficients C(n,50). A17714

a(n) = binomial(σ(n),τ(n)), where σ(n) is the sum and τ(n) the number of divisors of n (A000203, A000005). A68904

a(n) = C(2·3^n-1, n). A179432

Binomial coefficients C(54,n). A17770

Number of 5-member subsets of [5·n] whose elements sum to a multiple of n. A318626