Properties of the Number 19526

Nineteen Thousand Five Hundred Twenty-Six

Basics

Value: 19525 → 19526 → 19527

Parity: even

Prime: No

Previous Prime: 19507

Next Prime: 19531

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 13 × 751

Divisors: 1, 2, 13, 26, 751, 1502, 9763, 19526

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110001000110

Octal: 46106

Duodecimal: B372

Hexadecimal: 4c46

Square: 381264676

Square Root: 139.73546436034053

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 such that every pair of distinct parts has a different quotient. A325853

Number of edges among all distinct circles that can be constructed from n equally spaced points along a line using only a compass. A359254

The minimal number which has multiplicative persistence 7 in base n. A64871

a(n) = n³ + 6·n² + 6·n + 1. A90197

Let v = list of denominators of Farey series of order n (see A006843); a(n) = sum of products of adjacent terms of v. A278046

a(1)=1, a(2)=2; thereafter a(n) = a(n-1) + a(n-1-(number of even terms so far)) + a(n-1-(number of odd terms so far)). A249039

Smallest number with multiplicative persistence n in base 15. A320721

Number of ordered triples (w,x,y) with all terms in {1,...,n} and w²+x²+y²>2n. A211644

Number of entries in the eighth cycles of all permutations of [n] when cycles are ordered by decreasing lengths. A332857

A382168 with duplicates removed. A382169