Properties of the Number 35812

Thirty-Five Thousand Eight Hundred Twelve

Basics

Value: 35811 → 35812 → 35813

Parity: even

Prime: No

Previous Prime: 35809

Next Prime: 35831

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 7 × 1279

Divisors: 1, 2, 4, 7, 14, 28, 1279, 2558, 5116, 8953

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000101111100100

Octal: 105744

Duodecimal: 18884

Hexadecimal: 8be4

Square: 1282499344

Square Root: 189.24058761270004

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 k such that 3^k + 26 is prime. A219044

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 nXk array. A218897

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than one. A269537

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by one or less. A269606

Cupolar numbers: a(n) = (n+1)*(5·n² + 7·n + 3)/3. A96000

The number of edges inside a heptagon formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts. A333112

Number of binary strings of length n avoiding "squares" (that is, repeated blocks of the form xx) with |x| > 2. A229614

Number of Dyck paths of semilength n such that every peak at level y > 1 is preceded by (at least) one peak at level y-1 and is followed by (at least) one peak at level y-1. A287776

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

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A381572. A381571