Properties of the Number 20695

Twenty Thousand Six Hundred Ninety-Five

Basics

Value: 20694 → 20695 → 20696

Parity: odd

Prime: No

Previous Prime: 20693

Next Prime: 20707

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 4139

Divisors: 1, 5, 4139, 20695

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101000011010111

Octal: 50327

Duodecimal: BB87

Hexadecimal: 50d7

Square: 428283025

Square Root: 143.85756844879592

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

Sums of 7 distinct powers of 3. A38469

a(n) = A000523(A372444(n)); One less than the length of binary expansion of the n-th iterate of 27 with A371094. A372449

Number of ways to partition the set of divisors of the n-th abundant number into three subsets such that their sums form an integer triangle. A91235

Numbers m such that each of p=6·m+1, q=6·p+1, r=6·q+1 and s=6·r+1 is prime. A263311

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 286", based on the 5-celled von Neumann neighborhood. A271123

Number of partitions p of n such that (number of numbers in p that have multiplicity 1) >= (number of numbers in p having multiplicity > 1). A330145

Pisot sequence E(2,3). A20695

Array read by ascending antidiagonals: A(n, k) = ∑_j=0..n binomial(k, j)*|Stirling1(n, j)|. A387152