Properties of the Number 25103

Twenty-Five Thousand One Hundred Three

Basics

Value: 25102 → 25103 → 25104

Parity: odd

Prime: No

Previous Prime: 25097

Next Prime: 25111

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 13 × 1931

Divisors: 1, 13, 1931, 25103

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001000001111

Octal: 61017

Duodecimal: 1263B

Hexadecimal: 620f

Square: 630160609

Square Root: 158.4392628107061

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 whose run-lengths are either weakly increasing or weakly decreasing. A332745

Anagrexpo integers: integers N that exactly reproduce their set of digits when we form the set of exponentiation of pairs of adjacent digits, from left to right. A297627

Numerators of the partial sums of the reciprocals of the alternating sum of divisors function (A206369). A379619

Concatenating n with n+1 (in base 10) gives a number which is the product of 2 palindromes. A113942

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

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (F(2), F(3), F(4), ...). A25103