Properties of the Number -25465

Twenty-Five Thousand Four Hundred Sixty-Five

Basics

Value: -25466 → -25465 → -25464

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 11 × 463

Divisors: 1, 5, 11, 55, 463, 2315, 5093, 25465

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110001101111001

Octal: -61571

Duodecimal: -128A1

Hexadecimal: -6379

Square: 648466225

Square Root: 159.57756734578956

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

Number of times a number of the form 4n+2 is encountered when iterating from 2ⁿ⁺¹-2 to (2ⁿ)-2 with the map x -> x - (number of runs in binary representation of x). A255126

a(n) = 5·a(n-1) - 5·a(n-2) - 3·a(n-3). A137212

Number of 2 X 2 matrices with all elements in {-n,..,0,..,n} with determinant = 2·permanent. A280343

Lexicographically earliest sequence of distinct terms > 0 such that the sum a(n) + a(n+1) is a substring of the concatenation (a(n), a(n+1)). A359482

Pseudoprimes to base 21. A20149

Numbers k such that k and k² use only the digits 2, 4, 5, 6 and 8. A137095

The hyper-Wiener index of the zig-zag polyhex nanotube TUHC₆[2n,2] defined pictorially in Fig. 1 of the Eliasi et al. reference. A227704

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