Properties of the Number 25142

Twenty-Five Thousand One Hundred Forty-Two

Basics

Value: 25141 → 25142 → 25143

Parity: even

Prime: No

Previous Prime: 25127

Next Prime: 25147

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 13 × 967

Divisors: 1, 2, 13, 26, 967, 1934, 12571, 25142

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001000110110

Octal: 61066

Duodecimal: 12672

Hexadecimal: 6236

Square: 632120164

Square Root: 158.56229059899457

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

a(n) = (-4·n³ + 27·n² - 20·n + 3)/3. A161711

Number of non-knapsack integer partitions of n. A366754

a(n) = ∑_{k=0..floor(n/2)} binomial(k,3*(n-2·k)). A392253

Number of compositions of 7·n-1 into parts 6 and 7. A373933

a(n) = ∑_{k=0..floor(n/3)} binomial(k+1,2·n-6·k+1). A392490

Number of 4 X n nonnegative integer matrices with all column sums 4, up to row and column permutation. A58410

Number of Motzkin meanders of length n with an even number of humps. A307555

a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero icosahedral numbers in exactly n ways, or -1 if no such integer exists. A360215

Fixed point of the square runlength transform, with a(1) = 1 (the runlength transform of a binary sequence is the sequence of the lengths of its runs). A25142

Number of tilings of a 3 X n rectangle using pentominoes of any shape and monominoes. A278875