Properties of the Number 96862

Ninety-Six Thousand Eight Hundred Sixty-Two

Basics

Value: 96861 → 96862 → 96863

Parity: even

Prime: No

Previous Prime: 96857

Next Prime: 96893

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 × 19 × 2549

Divisors: 1, 2, 19, 38, 2549, 5098, 48431, 96862

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10111101001011110

Octal: 275136

Duodecimal: 4807A

Hexadecimal: 17a5e

Square: 9382247044

Square Root: 311.2266055465053

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

Half the number of ways of placing up to n pawns on a length n chessboard row so that the row balances at its middle. A133406

Consider all integer triples (i,j,k), j,k>0, with i³=j³+binomial(k+2,3), ordered by increasing i; sequence gives i values. A54234

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, 1, -1), (1, -1, 1), (1, 0, 1)}. A148945

Function A062402(x)=σ(φ(x)) is iterated. Starting with n, a(n) is the count of distinct terms arising during this trajectory; a(n)=t(n)+c(n)=t+c, where t is the number of transient terms, c is the number of recurrent terms [in the terminal cycle]. A96862