Properties of the Number -25367

Twenty-Five Thousand Three Hundred Sixty-Seven

Basics

Value: -25368 → -25367 → -25366

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 25367

Divisors: 1, 25367

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110001100010111

Octal: -61427

Duodecimal: -1281B

Hexadecimal: -6317

Square: 643484689

Square Root: 159.27021064844487

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

E.g.f.: exp(1 + x + x²/2! - exp(x)). A293038

Number of integer partitions of n that are not pairwise coprime, where a singleton is not coprime unless it is (1). A335240

Smallest of 3 consecutive prime numbers such that p1·p2·p3·d1·d2=average of twin prime pairs; p1,p2,p3 consecutive prime numbers; d1(δ)=p2-p1, d2(δ)=p3-p2. A153409

Number of partitions p of n such that the multiplicity of (min(p) + max(p))/2 is a part. A240497

Record values in A061026, the smallest number m such that n divides φ(m), where φ is Euler's totient function. A233517

Records in A066674. A125879

a(n) is the total number of down steps between the second and third up steps in all 2_1-Dyck paths of length 3·n. A 2_1-Dyck path is a lattice path with steps (1, 2), (1, -1) that starts and ends at y = 0 and stays above the line y = -1. A334643

Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..6 array extended with zeros and convolved with 1,2,2,1. A222109

a(n) = k if the last Dyck path that is counted in A279286(n) is the k-th Dyck path. A282198

Triangle read by rows: T(n,k) is the numerator of the probability of winning a 1-player game M(n,k) as defined below while playing optimally. A370398