Properties of the Number 11430

Eleven Thousand Four Hundred Thirty

Basics

Value: 11429 → 11430 → 11431

Parity: even

Prime: No

Previous Prime: 11423

Next Prime: 11437

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 127

Divisors: 1, 2, 3, 5, 6, 9, 10, 15, 18, 30

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10110010100110

Octal: 26246

Duodecimal: 6746

Hexadecimal: 2ca6

Square: 130644900

Square Root: 106.91117808723277

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

Triangle T(n,k) read by rows: number of labeled trees with n nodes and k leaves, n >= 2, 2 <= k <= n. A55314

a(n) = (2·n-1)*(n² -n +2)/2. A63488

Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly four solutions. A230856

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 4. A50052

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 4. A50036

a(n) = a(n-1) + a(m) for n >= 3, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = 3. A50068

Number of ways to write n as an ordered sum of 10 nonzero triangular numbers. A340955

A Chebyshev-related transform of the Fibonacci numbers. A112576

G.f.: (1-8·x-sqrt(64·x²-20·x+1))/(2·x). A82367

The Gi1 and Gi2 sums of Losanitsch's triangle A034851. A192928