Properties of the Number 99651

Ninety-Nine Thousand Six Hundred Fifty-One

Basics

Value: 99650 → 99651 → 99652

Parity: odd

Prime: No

Previous Prime: 99643

Next Prime: 99661

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 59 × 563

Divisors: 1, 3, 59, 177, 563, 1689, 33217, 99651

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000010101000011

Octal: 302503

Duodecimal: 49803

Hexadecimal: 18543

Square: 9930321801

Square Root: 315.6754662624259

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

a(n) = T(n, 2n-3), T given by A027023. A27027

a(n) = greatest number in row n of array T given by A027023. A27039

G.f.: 1 = ∑_n>=0 a(n) * xⁿ / (1 + x*(1+x)ⁿ)ⁿ⁺¹. A337849

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, 0, 1), (1, -1, 1), (1, 1, -1)}. A148377

For each of the C(10,2) = 45 pairs of decimal digits, record the smallest prime containing only these digits (if one exists); sort. A99651

Table read by antidiagonals: T(b,n) is the number of n-step self avoiding walks on a 2D square grid confined inside an infinite well of width 2b where the walk starts at the middle of the well bottom. A336863

Table read by antidiagonals: T(b,n) is the number of n-step self avoiding walks on a 2D square grid confined inside a square box of dimension 2b X 2b where the walk starts at the middle of one of the box's edges. A336872