Properties of the Number 33890

Thirty-Three Thousand Eight Hundred Ninety

Basics

Value: 33889 → 33890 → 33891

Parity: even

Prime: No

Previous Prime: 33889

Next Prime: 33893

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 3389

Divisors: 1, 2, 5, 10, 3389, 6778, 16945, 33890

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010001100010

Octal: 102142

Duodecimal: 17742

Hexadecimal: 8462

Square: 1148532100

Square Root: 184.09236811991963

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 k·19^k - 1 is prime. A299382

a(n) = n³ + (n+1)*(n+2). A270109

a(n) = floor(a(n-1)/2) + a(n-2) with a(0)=1, a(1)=2. A64650

Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,3,9, Q starts with 2,6, R starts with 4; at each stage the smallest number not yet present in P,Q,R is appended to R. Sequence gives P. A225385

Expansion of (G(-x) / χ(-x))² in powers of·where χ() is a Ramanujan θ function and G() is a Rogers-Ramanujan function. A261866

Expansion of g³/(1 - x²*g), where g = 1+x·g⁴ is the g.f. of A002293. A391102

Erroneous version of A006758. A195741

a(n) = Fibonacci(4·n + 2). A33890

Triangle read by rows: DR(n,d) is the number of properly d-dimensional polyominoes with n cells, modulo translations and rotations (n >= 1, 0 <= d <= n-1). A195738