Properties of the Number 4631

Four Thousand Six Hundred Thirty-One

Basics

Value: 4630 → 4631 → 4632

Parity: odd

Prime: No

Previous Prime: 4621

Next Prime: 4637

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 11 × 421

Divisors: 1, 11, 421, 4631

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001000010111

Octal: 11027

Duodecimal: 281B

Hexadecimal: 1217

Square: 21446161

Square Root: 68.05145112339633

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

Numbers that are the sum of 5 positive 7th powers. A3372

Numbers k such that the decimal expansions of both k and k² have 1 as smallest digit and 6 as largest digit. A257197

T(n,k)=Number of nXk 0..3 arrays with no element x(i,j) adjacent to value 3-x(i,j) horizontally or antidiagonally, top left element zero, and 1 appearing before 2 in row major order. A233082

Array read by antidiagonals: T(m,n) = number of m X n matrices M with entries {0,1,2} that have M_1,1=0, M_m,n=2, are such that the rows and columns are monotonic without jumps of 2, and satisfy M_(i+1),(j+1) = M_i,j + (0 or 1). A323846

Positive integers n such that 2ⁿ == 2¹¹ (mod n). A15935

Thickened cube numbers: a(n) = n*(n² + (n-1)²) + (n-1)*2·n*(n-1). A50492

Index sequence to A089840: positions of bijections that preserve A127302 (the non-oriented form of binary trees) and whose behavior does not depend on whether there are internal or terminal nodes (leaves) in the neighborhood of any vertex. A153830

a(n) is the conjectured highest power of n which has no four identical digits in succession. A216065

Odd integers n such that 2ⁿ == 2¹¹ (mod n). A276971

a(n) = ceiling((n³)/2). A36486