Properties of the Number 99036

Ninety-Nine Thousand Thirty-Six

Basics

Value: 99035 → 99036 → 99037

Parity: even

Prime: No

Previous Prime: 99023

Next Prime: 99041

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ³ × 7 × 131

Divisors: 1, 2, 3, 4, 6, 7, 9, 12, 14, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000001011011100

Octal: 301334

Duodecimal: 49390

Hexadecimal: 182dc

Square: 9808129296

Square Root: 314.6998570066405

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..3 arrays with the maximum plus the upper median minus the lower median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one. A238298

a(n) = n*(n-1)*(n² + 2)/6. A71244

Number of (n+1) X (1+1) 0..3 arrays with the maximum plus the upper median minus the lower median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one. A238293

Number of (n+1)X(4+1) 0..3 arrays with the maximum plus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A238296

a(n) = 2ⁿ - Fibonacci(n). A99036

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of edges in the resulting planar graph. A367324