Properties of the Number -246016

Two Hundred Forty-Six Thousand Sixteen

Basics

Value: -246017 → -246016 → -246015

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ⁸ × 31 ²

Divisors: 1, 2, 4, 8, 16, 31, 32, 62, 64, 124

Polygonal

Triangular: No

Square: Yes

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111100000100000000

Octal: -740400

Duodecimal: -BA454

Hexadecimal: -3c100

Square: 60523872256

Square Root: 496

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

Sum of first n cubes; or n-th triangular number squared. A537

T(n,k) = Number of (n+2) X (k+2) 0..1 arrays with no 3 X 3 subblock diagonal sum equal to the antidiagonal sum or central row sum less than the central column sum. A257361

Numbers of the form p⁸*q² where p and q are distinct primes. A179699

Row sums of triangle A110205, where A110205(n,k) equals the sum of cubes of numbers < 2ⁿ having exactly k ones in their binary expansion. A110206

Triangle T, read by rows, equal to the matrix square of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106⁵](n-1,k-1) + [A113106⁵](n-1,k). A113108

Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically. A207363

Numbers k with the property that it is possible to write the base 2 expansion of k as concat(a₂,b₂), with a₂>0 and b₂>0 such that, converting a₂ and b₂ to base 10 as a and b, we have (a+b)² = k. A258844

Squares of even triangular numbers. A14738

Perfect powers k such that A052409(k) is equal to A052409(A366275(k)). A366278

"Late birds" in A390939: terms A390939(m) such that A390939(k) > A390939(m) for all k > m, where A390939 lists the keys added in the map initialized with T[1] = 1 and then repeatedly T[v] := k + (T[v] if defined else 0) for all key-value pairs (k, v) in T. A390941