Properties of the Number 69614

Sixty-Nine Thousand Six Hundred Fourteen

Basics

Value: 69613 → 69614 → 69615

Parity: even

Prime: No

Previous Prime: 69593

Next Prime: 69623

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 34807

Divisors: 1, 2, 34807, 69614

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000111111101110

Octal: 207756

Duodecimal: 34352

Hexadecimal: 10fee

Square: 4846108996

Square Root: 263.8446512628217

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

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A299675

Numbers k such that both k and k + 3 are consecutive deficient numbers. A317049

Erdős-Selfridge function: a(n) is the least number m > n+1 such that the least prime factor of binomial(m, n) is > n. A3458

Number of n X 6 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A299673

Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A299671

a(1) = 2; a(2n) = smallest prime starting (the most significant digits) with a(2n-1) (i.e., as a right concatenation of a(2n-1) and a number with no insignificant zeros); a(2n+1) = smallest prime ending in (the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes. A69614