Properties of the Number -366025

Three Hundred Sixty-Six Thousand Twenty-Five

Basics

Value: -366026 → -366025 → -366024

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 ² × 11 ⁴

Divisors: 1, 5, 11, 25, 55, 121, 275, 605, 1331, 3025

Polygonal

Triangular: No

Square: Yes

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -1011001010111001001

Octal: -1312711

Duodecimal: -1579A1

Hexadecimal: -595c9

Square: 133974300625

Square Root: 605

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

Numbers of the form 5ⁱ * 11^j. A3598

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,2 or 2,2. A264017

a(n) is the smallest number k such that the symmetric representation of σ(k) consists of n parts of width 1. A318843

Numbers k that divide 3^k + 2^k. A45576

Numbers k such that k | 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k. A56739

a(n) = A322248(n)², the square of the central coefficient in (1 + 5·x + 16·x²)ⁿ. A322249

Numbers k such that A071187(k) <> A329614(k). A329613

Number of (4+1) X (n+1) arrays of permutations of 0..n·5+4 with each element having index change +-(.,.) 0,0 1,2 or 2,2. A264019

a(n) is the smallest number k whose symmetric representation of σ(k) consists of n regions (or parts) and whose areas are strictly decreasing towards the diagonal. A338534

Triangle whose (i,j)-th entry is binomial(i,j)*5^i-j*11^j. A38253