ℕ atory
Play Now

Properties of the Number 11830

Eleven Thousand Eight Hundred Thirty

Basics

Value: 11829 → 11830 → 11831

Parity: even

Prime: No

Previous Prime: 11827

Next Prime: 11831

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 7 × 13 2

Divisors: 1, 2, 5, 7, 10, 13, 14, 26, 35, 65

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111000110110

Octal: 27066

Duodecimal: 6A1A

Hexadecimal: 2e36

Square: 139948900

Square Root: 108.76580344942982

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

Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188). A64114
Number of distinct factorizations of n! with all factors > 1. A76716
T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms. A249844
Number of reversible strings with n-1 beads of 2 colors. 4 beads are black. String is not palindromic. A32091
Numbers k that, when expressed in base 5 and then interpreted in base 7, give a multiple of k. A62929
This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,5). The p-th row (p>=1) contains a(i,p) for i=1 to 5·p-4, where a(i,p) satisfies ∑i=1..n C(i+4,5)p = 6·C(n+5,6) * ∑i=1..5·p-4 a(i,p) * C(n-1,i-1)/(i+5). A87109
Bi-unitary weird numbers: bi-unitary abundant numbers (A292982) that are not bi-unitary pseudoperfect (A292985). A292986
Infinitary weird numbers: infinitary abundant numbers (A129656) that are not infinitary pseudoperfect numbers (A306983). A306984
Numbers n such that sopf(φ(n)) = φ(sopf(n)), where sopf(x) = sum of the distinct prime factors of x. A76531
a(n) = 2·a(n-1) + 2·a(n-3) + a(n-4), with a(0)=1, a(1)=2, a(3)=4, a(4)=10. A89928