Properties of the Number 83325

Eighty-Three Thousand Three Hundred Twenty-Five

Basics

Value: 83324 → 83325 → 83326

Parity: odd

Prime: No

Previous Prime: 83311

Next Prime: 83339

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 ² × 11 × 101

Divisors: 1, 3, 5, 11, 15, 25, 33, 55, 75, 101

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: 10100010101111101

Octal: 242575

Duodecimal: 40279

Hexadecimal: 1457d

Square: 6943055625

Square Root: 288.66070047722116

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

Numbers m such that the largest digit in the decimal expansion of 1/m is 2. A341383

Moment of inertia of all magic squares of order n. A126275

a(n) = (n+1)(n+2)³*(n+3)(n² + 4n + 5)/120. A114239

Number of partially achiral rooted trees. A3240

Number of length n+6 0..2 arrays with at most two downsteps in every 6 consecutive neighbor pairs. A255620

Number of length n+5 0..2 arrays with at most two downsteps in every n consecutive neighbor pairs. A255627

a(n) = (8·n³ + 12·n² + 4·n - 9)/3. A358035

a(n) = ceiling(sqrt(2·a(n-1)*a(n-2))), a(1) = a(2) = 1. A318053

T(n,k)=Number of length n+k 0..2 arrays with at most two downsteps in every k consecutive neighbor pairs. A255622

a(n) = 5ⁿ - 4ⁿ + 3ⁿ. A83325