Properties of the Number 61141

Sixty-One Thousand One Hundred Forty-One

Basics

Value: 61140 → 61141 → 61142

Parity: odd

Prime: Yes

Previous Prime: 61129

Next Prime: 61151

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 61141

Divisors: 1, 61141

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110111011010101

Octal: 167325

Duodecimal: 2B471

Hexadecimal: eed5

Square: 3738221881

Square Root: 247.2670621008791

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

Primes having only {1, 4, 6} as digits. A260269

Primes p such that p+1, p+2, p+3 and p+4 have equal number of divisors. A119728

Primes 8k + 5 at the end of the maximal gaps in A269513. A269515

Number of zero-sum -n..n arrays of 5 elements with first and second differences also in -n..n. A201876

Least prime factor of (2n+1)²ⁿ⁺¹+2. A228613

Primes obtained by merging 5 successive digits in the decimal expansion of sqrt(2) + sqrt(3) + sqrt(5). A241221

Primes k such that the concatenation of (b, k, b) and (k, b, k) are both prime, where b is the binary representation of k. A389801

Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 19. A31607

Compute sum of divisors of the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the largest. A61141

Number of -n..n arrays x(0..7) of 8 elements with zero sum and no two or three adjacent elements summing to zero. A200435