Properties of the Number -89846

Eighty-Nine Thousand Eight Hundred Forty-Six

Basics

Value: -89847 → -89846 → -89845

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 35

Digital Root: 8

Palindrome: No

Factorization: 2 × 167 × 269

Divisors: 1, 2, 167, 269, 334, 538, 44923, 89846

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10101111011110110

Octal: -257366

Duodecimal: -43BB2

Hexadecimal: -15ef6

Square: 8072303716

Square Root: 299.74322344299964

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

Expansion of ((1 + x - 2x²) + (1+x)*sqrt(1-4x²))/(2(1-4x²)). A116406

Expansion of (sqrt(1 - 4·x) + (1 - 2·x))/(2*(1 - 4·x)). A114121

a(n) = ∑_k=0..9 binomial(n,k). A8862

a(n) = 2ⁿ - C(n,0) - C(n,1) - ... - C(n,7). A35040

a(n) = number of subsets of {1,2,...,n} that contain more nonprimes than primes. A369853

Number of walks of length n starting at origin and ending in first quadrant on a square lattice. A187151

The difference between the two largest distinct parts of a partition (0 if no distinct parts), summed over all partitions of n. A268191

A(n,k) = ∑_{j=0..floor(n/k)} binomial(2·n,k·j+n), square array A(n,k) read by antidiagonals, for n >= 0, k >= 1. A307665

Number of log-concave paths of length n starting from the origin (0,0) with steps from {N=(0,1), E=(1,0) and S=(0,-1)} that stay in the second octant and never touch the line y=x except possibly at the beginning or the end. A79280