Properties of the Number 10830

Ten Thousand Eight Hundred Thirty

Basics

Value: 10829 → 10830 → 10831

Parity: even

Prime: No

Previous Prime: 10799

Next Prime: 10831

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 19 ²

Divisors: 1, 2, 3, 5, 6, 10, 15, 19, 30, 38

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10101001001110

Octal: 25116

Duodecimal: 6326

Hexadecimal: 2a4e

Square: 117288900

Square Root: 104.06728592598157

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

4-dimensional pyramidal numbers: a(n) = n²*(n²-1)/12. A2415

Expansion of 1/(1 - x - x² + x⁶ - x⁸). A225393

a(n) = G_n(5), where G_n(k) is the Goodstein function defined in A266201. A266204

Numbers k such that k!!! + 1 is prime (0 is included by convention). A37083

a(n) is the smallest number k such that r·k + 1 is prime for all r = 1 to n. A88250

a(n) = (2/(n-1))*a(n-1) + ((n+5)/(n-1))*a(n-2) with a(0)=0 and a(1)=1. A96338

Number of widely totally strongly normal compositions of n. A332337

T(n,k)=Number of nXk 0..2 arrays with all horizontally or vertically connected equal values in a straight line, and new values 0..2 introduced in row major order. A223387

T(n,k)=Number of nXk binary arrays with some element plus some horizontally or vertically adjacent neighbor totalling two no more than once. A268750

At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage. A64412