Properties of the Number 36241

Thirty-Six Thousand Two Hundred Forty-One

Basics

Value: 36240 → 36241 → 36242

Parity: odd

Prime: Yes

Previous Prime: 36229

Next Prime: 36251

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 36241

Divisors: 1, 36241

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000110110010001

Octal: 106621

Duodecimal: 18B81

Hexadecimal: 8d91

Square: 1313410081

Square Root: 190.370691021491

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

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

a(n) = ∑_i=0..n digsum₆(i)⁴, where digsum₆(i) = A053827(i). A231675

a(n) is the n-th prime whose decimal expansion begins with the decimal expansion of n. A77345

Number of 2Xn 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A281470

Primes with 19 as smallest positive primitive root. A61331

Primes that are the sum of all composite numbers in-between prime numbers p(n) and p(n+2). A174521

Terms k of A112998 such that k+2 is nonsquarefree. A328160

Numbers k such that (493·10^k - 7)/9 is prime. A275410

T(n,k)=Number of nXk 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A281469

a(1)=1, a(2)=2, a(3)=3; for n >= 3, a(n) is smallest number such that all a(i) for 1 <= i <= n are distinct, all a(i)+a(j) for 1 <= i < j <= n are distinct and all a(i)+a(j)+a(k) for 1 <= i < j < k <= n are distinct. A36241