Properties of the Number -69096

Sixty-Nine Thousand Ninety-Six

Basics

Value: -69097 → -69096 → -69095

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: Yes

Factorization: 2 ³ × 3 × 2879

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 2879, 5758

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10000110111101000

Octal: -206750

Duodecimal: -33BA0

Hexadecimal: -10de8

Square: 4774257216

Square Root: 262.86118009321956

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 (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j⁴*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i⁴*x(i,j), i=1..n+1} nondecreasing. A232852

Cyclops numbers with circular digits {0,6,8,9}. A274765

Number of nX3 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 0,1,0,0,0 for x=0,1,2,3,4. A197470

Number of permutations of floor(i·7/3), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique. A147937

Number of permutations of floor(i·7/3), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique. A147946

Number of (n+1)X(2+1) 0..2 arrays x(i,j) with row sums sum{j⁴*x(i,j), j=1..2+1} nondecreasing, and column sums sum{i⁴*x(i,j), i=1..n+1} nondecreasing. A232850

Positive integers k at which k/log₂(k) is at a record closeness to an integer, without actually being an integer. A307099