Properties of the Number 5141

Five Thousand One Hundred Forty-One

Basics

Value: 5140 → 5141 → 5142

Parity: odd

Prime: No

Previous Prime: 5119

Next Prime: 5147

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 53 × 97

Divisors: 1, 53, 97, 5141

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010000010101

Octal: 12025

Duodecimal: 2B85

Hexadecimal: 1415

Square: 26429881

Square Root: 71.7007670809734

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 with all adjacent parts (x, y) satisfying x >= 2y or y = 2x. A342335

Least integer b>2n+1 such that the numbers written as [1,3,...,2n-1,2n+1] and [2n+1,2n-1,...,3,1] in base b are both prime. A218465

Stern-Jacobsthal numbers. A101624

Integers i such that 15·i = A048720bi(23,i). A115774

Numbers a(n) are obtained by the direct application of sieve of Eratosthenes for A000695: retaining A000695(2)=4, we delete all multiples of 4, which are more than 4; retaining A000695(3)=5, we delete all multiples of 5, which are more than 5, etc. A152021

The positions i where A163355(i) = i, that is, the fixed points of permutation A163355. A163901

A bisection of the Stern-Jacobsthal numbers. A101625

Numbers k such that ∑_i=1..k i^τ(i) == 0 (mod k), where τ(i) = A000005(i), the number of divisors of i. A229095

Number of partitions of n containing no part i of multiplicity i+1. A277099

Smallest semiprime p·q such that q >= p and q mod p = n. A64910