Properties of the Number -89898

Eighty-Nine Thousand Eight Hundred Ninety-Eight

Basics

Value: -89899 → -89898 → -89897

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 42

Digital Root: 6

Palindrome: Yes

Factorization: 2 × 3 × 14983

Divisors: 1, 2, 3, 6, 14983, 29966, 44949, 89898

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10101111100101010

Octal: -257452

Duodecimal: -44036

Hexadecimal: -15f2a

Square: 8081650404

Square Root: 299.82995180601955

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

Triangular array read by rows associated with Schroeder numbers: T(1,k) = 1; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k). A33877

Numbers whose smallest decimal digit is 8. A284069

Royal paths in a lattice. A6320

Smallest palindrome with digit sum = n. A62388

Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 (i.e., E steps from the line y=x+1 to the line y = x). A110098

Triangular array associated with Schroeder numbers: T(0,0) = 1, T(n,0) = 0 for n > 0; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k). A106579

Riordan array (1, x·f(x)) where f(x)is the g.f. of A006318. A122538

Palindromic admirable numbers. A109759

Palindromes sandwiched between twin primes. A113838

a(1)=1, a(2)=3, a(3)=8; for n>=4, a(n) = 10·a(n-3) + 8 (if a(n-3) is odd) or + 9 (if a(n-3) is even). A117713