Properties of the Number 65523

Sixty-Five Thousand Five Hundred Twenty-Three

Basics

Value: 65522 → 65523 → 65524

Parity: odd

Prime: No

Previous Prime: 65521

Next Prime: 65537

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 21841

Divisors: 1, 3, 21841, 65523

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111111111110011

Octal: 177763

Duodecimal: 31B03

Hexadecimal: fff3

Square: 4293263529

Square Root: 255.97460811572697

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(1)=a(2)=a(3)=1; for n>3, a(n)=(a(n-1)*a(n-2)+a(n-1)+a(n-2))/a(n-3). A72881

T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..3 nXk array. A218638

Numbers k such that (k+j) mod (2+j) = 1 for j from 0 to 8 and (k+9) mod 11 <> 1. A96026

Values of A102370 which are >= a new power of 2. A103529

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 181", based on the 5-celled von Neumann neighborhood. A286405

Number of 1s in the first 2ⁿ entries of the Kolakoski sequence, A000002. A289322

Hilltop maps: number of nX4 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..3 nX4 array. A218634

Hilltop maps: number of 4Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..3 4Xn array. A218639

Number of length 4 arrays x(i), i=1..4 with x(i) in i..i+n and no value appearing more than 3 times. A250362

Let F(n) = 2^2ⁿ + 1 = the n-th Fermat number, M(n) = 2ⁿ - 1 = the n-th Mersenne number. Then a(n) = F(n) - M(n) + 1 = 2^2ⁿ + 1 - (2ⁿ - 1) + 1 = 2^2ⁿ - 2ⁿ + 3. A119562