Properties of the Number -24465

Twenty-Four Thousand Four Hundred Sixty-Five

Basics

Value: -24466 → -24465 → -24464

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 7 × 233

Divisors: 1, 3, 5, 7, 15, 21, 35, 105, 233, 699

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -101111110010001

Octal: -57621

Duodecimal: -121A9

Hexadecimal: -5f91

Square: 598536225

Square Root: 156.41291506777821

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

Second-order Fibonacci numbers. A10049

Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032. A5845

Expansion of e.g.f. exp(-x²/2) / (1-x). A266

Every suffix prime and no 0 digits in base 9 (written in base 9). A24784

Triangle T(n,k), 0<=k<=n, read by rows, defined by: T(n,k)=0 if k>n, T(n,0) = A000108(n); T(n+1,k)= ∑_j=0..n T(n-j,k-1)*binomial(2j+1,j+1). A90285

Odd composite integers m such that A014448(m) == 4 (mod m). A335670

a(n) = ∑_k>=1 floor(τ^n-k) where τ is A001622. A20956

Triangle T(n,k) = number of permutations of n elements with k 2-cycles. A114320

Triangle T(n,k), the number of permutations on n elements that have no cycles of length k. A122974

a(n) = self-convolution of row n of array T given by A027926. A27989