Properties of the Number 25055

Twenty-Five Thousand Fifty-Five

Basics

Value: 25054 → 25055 → 25056

Parity: odd

Prime: No

Previous Prime: 25037

Next Prime: 25057

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 5011

Divisors: 1, 5, 5011, 25055

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110000111011111

Octal: 60737

Duodecimal: 125BB

Hexadecimal: 61df

Square: 627753025

Square Root: 158.28771272590933

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 integer partitions of n with integer mean and integer median. A359906

Number of compositions of n that are both a reversed necklace and a co-necklace. A334271

spt(n) - p(n): total number of smallest parts in all partitions of n minus the number of partitions of n. A215513

Starting at n, a(n) is the number of times we move from a positive spot to a spot we have already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away. A324684

Number of partitions p of n such that max(p) == 1 mod 3. A373014

Number of set partitions C'_t(n) of {1,2,...,t} into at most n parts, with an even number of elements in each part distinguished by marks and such that no part contains both 1 and t (each unmarked) or both i and i+1 (each unmarked) for some i with 1 <= i < t; triangle C'_t(n), t>=0, 0<=n<=t, read by rows. A261319

Numbers that are divisible by the product of the digit-sums of their neighbors. A152826

Positions of odd numbers in sequence A025051 (numbers of form j·k + k·i + i·j, without repetitions, where 1 <= i <= j <= k). A25055