Properties of the Number 89848

Eighty-Nine Thousand Eight Hundred Forty-Eight

Basics

Value: 89847 → 89848 → 89849

Parity: even

Prime: No

Previous Prime: 89839

Next Prime: 89849

Digit Sum: 37

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 11 × 1021

Divisors: 1, 2, 4, 8, 11, 22, 44, 88, 1021, 2042

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101111011111000

Octal: 257370

Duodecimal: 43BB4

Hexadecimal: 15ef8

Square: 8072663104

Square Root: 299.746559613284

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

Number of magic labelings of the cycle-of-loops graph LOOP X C₆ having magic sum n, where LOOP is the 1-vertex, 1-loop-edge graph. A244879

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1 with a(1) = a(2) = 1. A49940

Numbers n such that the digital sum of n is the same as the digital sum of n² in both base 2 and base 10. A261640

Number of nX5 0..1 arrays with every element unequal to 0, 1, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero. A317426

Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A089851/A089853. A89848

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero. A317429

Rectangular array read by antidiagonals: A(n,k) = number of magic labelings of the graph LOOP X C_n (see comments) having magic sum k, n >= 1, k >= 0. A293311

Rectangular array read by antidiagonals: A(n,k) = tr((M_n)^k), k >= 0, where M_n is the n X n matrix M₁ = {{1}}, M_n = {{0,...,0,1},{0,...,0,1,1},...,{0,1,...,1},{1,...,1}}, n > 1, and tr(.) is the trace. A293312