Properties of the Number 68552

Sixty-Eight Thousand Five Hundred Fifty-Two

Basics

Value: 68551 → 68552 → 68553

Parity: even

Prime: No

Previous Prime: 68543

Next Prime: 68567

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 11 × 19 × 41

Divisors: 1, 2, 4, 8, 11, 19, 22, 38, 41, 44

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10000101111001000

Octal: 205710

Duodecimal: 33808

Hexadecimal: 10bc8

Square: 4699376704

Square Root: 261.8243686137713

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 strings of length n over an 8-letter alphabet that begin with a nontrivial palindrome. A249641

Number of n-tuples of 0,1,2,3,4,5,6,7,8,9 without consecutive digits. A96261

Number of nondecreasing sequences of n 1..7 integers with every element dividing the sequence sum. A212535

Number of n X 2 binary arrays whose sum with another n X 2 binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order. A225894

a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...). A25099

Number of nondecreasing arrangements of n+3 numbers in 0..7 with each number being the sum mod 8 of three others. A183902

T(n,k) = Number of nondecreasing arrangements of n+3 numbers in 0..k with each number being the sum mod (k+1) of three others. A183904

Table read by upward antidiagonals: T(n,k) is the number of strings of length k over an n-letter alphabet that begin with a palindrome of two or more letters; n, k >= 1. A342237

2n·binomial(2n,n) - 4ⁿ. A68552