ℕ atory
Play Now

Properties of the Number 36845

Thirty-Six Thousand Eight Hundred Forty-Five

Basics

Value: 36844 → 36845 → 36846

Parity: odd

Prime: No

Previous Prime: 36833

Next Prime: 36847

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 × 7369

Divisors: 1, 5, 7369, 36845

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111111101101

Octal: 107755

Duodecimal: 193A5

Hexadecimal: 8fed

Square: 1357554025

Square Root: 191.9505144562004

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

T(n,k)=Number of nXk 0..2 arrays with antidiagonals unimodal and rows and diagonals nondecreasing. A223999
T(n,k)=Number of triangular nXnXn arrays colored with integers 0 upwards introduced in row major order, with no element equal to any neighbor, and containing the value n(n+1)/2-k-1. A211904
a(n) = ∑i=0..n digsum4(i)4, where digsum4(i) = A053737(i). A231667
a(n) is the denominator of the generalized continued fraction with terms σ(m)/m for m=1 to n. A254060
Number of nX6 0..2 arrays with antidiagonals unimodal and rows and diagonals nondecreasing. A223997
Number of 4 X n 0..2 arrays with antidiagonals unimodal and rows and diagonals nondecreasing. A224002
Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite APC = AlPO4-C [Al16P16O64 ](1,2) starting from a T1 atom. A18978
Number of triangular nXnXn arrays colored with integers 0 upwards introduced in row major order, with no element equal to any neighbor, and containing the value n(n+1)/2-4. A211901
a(n) = mink {T(n,k)} where T(n,k) is the "φ/σ tug-of-war sequence with seed n" defined by T(n,1) = φ(n), T(n,2) = σ(φ(n)), T(n,3) = φ(σ(φ(n))), ..., T(n,k) = φ(T(n,k-1)) if k is odd and = σ(T(n,k-1)) if k is even. A36845