Properties of the Number 68906

Sixty-Eight Thousand Nine Hundred Six

Basics

Value: 68905 → 68906 → 68907

Parity: even

Prime: No

Previous Prime: 68903

Next Prime: 68909

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 × 131 × 263

Divisors: 1, 2, 131, 262, 263, 526, 34453, 68906

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10000110100101010

Octal: 206452

Duodecimal: 33A62

Hexadecimal: 10d2a

Square: 4748036836

Square Root: 262.4995238090919

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

Number of primes with n digits. A6879

T(n,k) = Number of (n+1) X (k+1) 0..2 arrays colored with the maximum plus the lower median of every 2 X 2 subblock. A236719

Numbers that are the sum of six fifth powers in two or more ways. A345507

Numbers that are the sum of six fifth powers in exactly two ways. A346357

Numbers of the form 12·k + 2 with nonempty inverse totient set. A63668

Numbers n such that there are integers a < b with a²+(a+1)²+...+(n-1)² = (n+1)²+(n+2)²+...+b². A94552

a(n) = (7·n + 3)*(7·n + 4). A177071

Numbers n such that 2 * (1ⁿ + 2ⁿ + 3ⁿ + ... + nⁿ) is not 0 (mod n), but 2 * (1^d + 2^d + 3^d + ... + d^d) is 0 (mod d) for each other d | n. A280187

Squarefree oblong (pronic) numbers having an odd number of prime factors. A98827

Number of (n+1)X(2+1) 0..2 arrays colored with the maximum plus the lower median of every 2X2 subblock. A236713