Properties of the Number 62869

Sixty-Two Thousand Eight Hundred Sixty-Nine

Basics

Value: 62868 → 62869 → 62870

Parity: odd

Prime: Yes

Previous Prime: 62861

Next Prime: 62873

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 62869

Divisors: 1, 62869

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111010110010101

Octal: 172625

Duodecimal: 30471

Hexadecimal: f595

Square: 3952511161

Square Root: 250.7369139157615

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

Value of prime number D for incrementally largest values of minimal·satisfying the equation x² - D·y² = 3. A336794

Number of 7 X n 0..1 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing. A223843

Value of prime number D for incrementally largest values of minimal y satisfying the equation x² - D·y² = 3. A336796

Primes p such that p, x+y, x-y, p-x·y and p+x·y are prime, where y = p mod 5 and x = (p-y)/5. A342771

T(n,k) = number of n X k 0..1 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing. A223838

Triangle read by rows: For n >= 0, k >= 0, T(n,k) is the number of permutations π of n such that the total distance Sum_i abs(i-π(i)) = 2k. Equivalently, k = Sum_i max(i-π(i),0). A62869

Triangle read by rows in which row n gives list of prime factors of p^p + 1 where p = prime(n). A125136