Properties of the Number 13833

Thirteen Thousand Eight Hundred Thirty-Three

Basics

Value: 13832 → 13833 → 13834

Parity: odd

Prime: No

Previous Prime: 13831

Next Prime: 13841

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 29 × 53

Divisors: 1, 3, 9, 29, 53, 87, 159, 261, 477, 1537

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011000001001

Octal: 33011

Duodecimal: 8009

Hexadecimal: 3609

Square: 191351889

Square Root: 117.61377470347595

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

Pseudoprimes to base 10. A5939

a(n) = n*(n+2)*(2·n-1)/3. Also, row sums of triangle A131422. A131423

Card-matching numbers (Dinner-Diner matching numbers). A59073

Number of non-subset-sums of strict integer partitions of n. A365922

Composite numbers k that divide 3^k - 2^k - 1, excluding powers of 2, 3 and 7. A127073

Expansion of g.f. A(x,y) satisfying x·y = ∑_n=-oo..+oo x^n*(3·n+1/2) * (A(x,y)^3·n - 1/A(x,y)^3·n+1), as a triangle read by rows. A361550

Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 6 sites wide. A58367

Numbers n such that n is not the power of a prime and such that for every prime divisor p of n, p-1 divides n-1. A87442

Odd composite integers m such that A006497(m-J(m,13)) == 2·J(m,13) (mod m), where J(m,13) is the Jacobi symbol. A339126

Card-matching numbers (Dinner-Diner matching numbers). A59058