Properties of the Number 4131

Four Thousand One Hundred Thirty-One

Basics

Value: 4130 → 4131 → 4132

Parity: odd

Prime: No

Previous Prime: 4129

Next Prime: 4133

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ⁵ × 17

Divisors: 1, 3, 9, 17, 27, 51, 81, 153, 243, 459

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000000100011

Octal: 10043

Duodecimal: 2483

Hexadecimal: 1023

Square: 17065161

Square Root: 64.27285585688566

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 such that every distinct consecutive subsequence has a different sum. A325676

Number G(n,k) of set partitions of {1,...,n} into sets of size at most k; triangle G(n,k), n>=0, 0<=k<=n, read by rows. A229223

Second 9-gonal (or nonagonal) numbers: a(n) = n*(7·n+5)/2. A179986

Numbers k such that the centered cube number k³ + (k+1)³ is equal to at least one other sum of two cubes. A352134

Number of ordered triples (i,j,k) with |i| + |j| + |k| <= n and gcd(i,j,k) <= 1. A100450

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7. A252433

Product of the 5th power of a prime (A050997) and a different prime (p⁵*q). A178740

Numbers that are the sum of 3 positive cubes in more than one way. A8917

Number of non-knapsack integer partitions of n. A366754

a(n) = Frobenius number for 4 successive primes = F[p(n), p(n+1), p(n+2), p(n+3)]. A138990