Properties of the Number 36413

Thirty-Six Thousand Four Hundred Thirteen

Basics

Value: 36412 → 36413 → 36414

Parity: odd

Prime: No

Previous Prime: 36389

Next Prime: 36433

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 13 × 2801

Divisors: 1, 13, 2801, 36413

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111000111101

Octal: 107075

Duodecimal: 190A5

Hexadecimal: 8e3d

Square: 1325906569

Square Root: 190.8219064992277

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

Positive numbers of the form x⁵-10x³*y²+5x·y⁴ (where x,y are integers and x>y). A135791

Numbers of the form x⁵-10x³*y²+5x·y⁴ (where x,y are integers). A135793

Total sum of odd parts in the last section of the set of partitions of n. A206435

Number of column-convex polyominoes with perimeter n. A6026

a(n) = σ(A003961(n²)), where A003961 is fully multiplicative with a(prime(i)) = prime(i+1), and σ is the sum of divisors function. A379482

Number of digits in n^n!. A202336

Numbers k such that 30·k - 1, 30·k + 1, 30·k² - 1 and 30·k² + 1 are all prime. A359184

Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 17. A51982

Expansion of g.f. A(x) satisfying 0 = ∑_k=0..n (-1)^k * binomial(2·n-k,k) * ([x^k] A(x)ⁿ) for n >= 1. A375450

Values of k for which there are no empty intervals when fractional_part(m·e) for m = 1, ..., k is plotted along [ 0, 1 ] subdivided into k equal regions. A36413