Properties of the Number 45436

Forty-Five Thousand Four Hundred Thirty-Six

Basics

Value: 45435 → 45436 → 45437

Parity: even

Prime: No

Previous Prime: 45433

Next Prime: 45439

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 37 × 307

Divisors: 1, 2, 4, 37, 74, 148, 307, 614, 1228, 11359

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011000101111100

Octal: 130574

Duodecimal: 22364

Hexadecimal: b17c

Square: 2064430096

Square Root: 213.15721897228815

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..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A240260

G.f. satisfies: A(x) = ∑_n>=0 xⁿ * ∏_k=0..n-1 A(u(n)^k*x), where u(n) = exp(2*π*I/n) is an n-th root of unity. A206725

Number of 3 X n 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A240262

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

Number of nX5 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A240259

Numbers k such that (σ(k) + σ(k + σ(k))) / k is an integer where σ(k) = A000203(k) is the sum of the divisors of k. A383392

G.f. A(x) satisfies: [xⁿ] A(x)^n*(n+1-1) / (x·A(x)ⁿ)' = 0 for n>1. A302060

Primes congruent to {1, 3} mod 7. A45436