Properties of the Number -45465

Forty-Five Thousand Four Hundred Sixty-Five

Basics

Value: -45466 → -45465 → -45464

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 7 × 433

Divisors: 1, 3, 5, 7, 15, 21, 35, 105, 433, 1299

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011000110011001

Octal: -130631

Duodecimal: -22389

Hexadecimal: -b199

Square: 2067066225

Square Root: 213.2252330283637

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

Expansion of 1/((1-x)*(1-5·x)*(1-6·x)*(1-10·x)). A22343

a(n) = 5·a(n-1) - 2·a(n-2); a(0)=1, a(1)=5. A107839

a(n) = 5·a(n-2) - 2·a(n-4), with initial terms 0,1,1,3. A5824

T(n,k)=Number of 0..k arrays x(0..n+1) of n+2 elements without any two consecutive increases or two consecutive decreases. A200838

Array read by antidiagonals: T(m,n) is the number of connected spanning subgraphs in the grid graph P_m X P_n. A359993

Expansion of e.g.f. cosh( x²/2 )/ (1-x). A193385

List of quadruples (r,s,t,u): the matrix M = [[9,24,16][3,10,8][1,4,4]] is raised to successive powers, then (r,s,t,u) are the square roots of M[3,1], M[3,3], M[1,1], M[1,3] respectively. A249581

a(n) = 5·a(n-2) - 2·a(n-4), n >= 4. A109165

Number of 0..6 arrays x(0..n+1) of n+2 elements without any two consecutive increases or two consecutive decreases. A200836

Number of 0..n arrays x(0..5) of 6 elements without any two consecutive increases or two consecutive decreases. A200841