Properties of the Number 32531

Thirty-Two Thousand Five Hundred Thirty-One

Basics

Value: 32530 → 32531 → 32532

Parity: odd

Prime: Yes

Previous Prime: 32507

Next Prime: 32533

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 32531

Divisors: 1, 32531

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111111100010011

Octal: 77423

Duodecimal: 169AB

Hexadecimal: 7f13

Square: 1058265961

Square Root: 180.36352181081406

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

Expansion of g.f. 1/ (1-x¹*(1-x^m+1)/ (1-x²*(1-x^m+2)/ (1- ... ))) for m=9. A228645

G.f. A(x) satisfies A(x/A(x)⁵) = 1/(1-x). A145165

Primes p == 3 (mod 4) such that the multiplicative order of 2+-i modulo p in Gaussian integers (A385165) is not divisible by 2 or 3. A385188

a(n) is the smallest prime in the interval [k·sqrt(k), k·sqrt(k+2)], where k = A001359(n), or a(n)=0 if there is no prime in this interval. A247867

a(n+1) is the smallest prime > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(1)=5. A242906

Primes of a056240-type 3. A300359

Pairs of consecutive primes {p,q} for which the numbers of distinct residues of all factorials mod p and mod q coincide. A210242

Number of partitions of n into 9 parts such that every i-th smallest part (counted with multiplicity) is different from i. A244245

Number of 0..6 arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo 7. A207098

Number of 0..n arrays x(0..6) of 7 elements with each no smaller than the sum of its two previous neighbors modulo (n+1). A207104