Properties of the Number 5631

Five Thousand Six Hundred Thirty-One

Basics

Value: 5630 → 5631 → 5632

Parity: odd

Prime: No

Previous Prime: 5623

Next Prime: 5639

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 1877

Divisors: 1, 3, 1877, 5631

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010111111111

Octal: 12777

Duodecimal: 3313

Hexadecimal: 15ff

Square: 31708161

Square Root: 75.03998933901843

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 compositions of n whose run-lengths are either weakly increasing or weakly decreasing. A332835

a(n) is the solution to the postage stamp problem with n denominations and 4 stamps. A1214

Number of integer partitions of n such that the dual of the multiset partition obtained by factoring each part into prime numbers is a (strict) antichain, also called T₁ integer partitions. A326977

Numbers n such that Q(sqrt(n)) has class number 10. A218042

Sum of the smallest parts of the partitions of n into 10 squarefree parts. A326628

a(n) = a(n-1) + a(m) for n >= 4, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = a(3) = 2. A50045

A sequence of asymptotic density ζ(10) - 1, where ζ is the Riemann ζ function. A143036

a(n) = (n+1)*2^n-1 - 1. A99035

a(n) = 11·2ⁿ - 1. A86225

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero. A298287