Properties of the Number 36829

Thirty-Six Thousand Eight Hundred Twenty-Nine

Basics

Value: 36828 → 36829 → 36830

Parity: odd

Prime: No

Previous Prime: 36821

Next Prime: 36833

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 13 × 2833

Divisors: 1, 13, 2833, 36829

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000111111011101

Octal: 107735

Duodecimal: 19391

Hexadecimal: 8fdd

Square: 1356375241

Square Root: 191.9088325221119

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

A 10th-order Fibonacci sequence. A127194

a(n) is the smallest number k such that τ(k + n) = τ(k) + n where τ(n) is the number of divisors of n (A000005). A305196

Number of 3 X n binary matrices such that any 2 rows have a common 1, up to column permutations. A52387

a(n) is the smallest nonprime k such that τ(k + n) = τ(k) + n , where τ(n) is the number of divisors of n (A000005). A99642

Triangle of Gely numbers, read by rows. A132795

a(n) = ceiling(n*φ¹⁵), where φ is the golden ratio, A001622. A4970

Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 14. A31602

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, 0, 1), (1, -1, 0), (1, 0, -1), (1, 1, 0)}. A150549

a(n) = ∑_j=0..10 n^j. A60885

a(n) = ∑_k=0..n-1 C(3·k,k)*C(3·n-3·k-2,n-k-1). A36829