Properties of the Number 36751

Thirty-Six Thousand Seven Hundred Fifty-One

Basics

Value: 36750 → 36751 → 36752

Parity: odd

Prime: No

Previous Prime: 36749

Next Prime: 36761

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 13 × 257

Divisors: 1, 11, 13, 143, 257, 2827, 3341, 36751

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111110001111

Octal: 107617

Duodecimal: 19327

Hexadecimal: 8f8f

Square: 1350636001

Square Root: 191.7055033117203

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(n) = 30·n² + 1. A158558

Triangle T(n,k) (n >= k >= 0) read by rows: T(n,0) = (1+(-1)ⁿ)/2; for k>=1, set T(0,k) = 0, S(n,k) = binomial(n,k)*binomial(n+k+1,k), and for n>=1, T(n,k) = S(n,k)-T(n-1,k). A331432

Expansion of g.f. 1/((1-6·x)*(1-7·x)*(1-8·x)). A20570

Numerators of continued fraction convergents to sqrt(249). A41466

Composite n such that (n-1)*φ(n) is a perfect square. A69953

Number of 2 X n 0..3 arrays with antidiagonals unimodal and rows and diagonals nondecreasing. A223962

Square array A(n, k) = ((k+2)ⁿ⁺² - 2 * (k+1)ⁿ⁺² + kⁿ⁺²)/2 for k, n >= 0 read by ascending antidiagonals. A372118

Number of strings of n distinct digits from 0-9 that are the last n digits of a square in base 8. A36751